Peter Pan and Crocodile are each getting hired for a job. Peter wants to get paid 6.4 dollars daily, but Crocodile demands to be paid 10 cents on day 1, 20 cents on day 2, 40 cents on day 3, 80 cents on day 4, and so on. After how many whole days will Crocodile's total earnings exceed that of Peter's?
To determine after how many whole days Crocodile's total earnings will exceed Peter's, we need to set up the equations for their earnings and solve for the number of days, \( n \).

1. **Calculate Peter's total earnings after \( n \) days:**
   Peter earns $6.4 per day. Therefore, after \( n \) days, Peter's total earnings, \( P(n) \), is:
   \[
   P(n) = 6.4n
   \]

2. **Calculate Crocodile's total earnings after \( n \) days:**
   Crocodile's earnings double each day, starting from 10 cents on day 1. This forms a geometric series where the first term \( a = 0.1 \) dollars and the common ratio \( r = 2 \). The total earnings after \( n \) days, \( C(n) \), is the sum of the first \( n \) terms of this geometric series:
   \[
   C(n) = 0.1 + 0.2 + 0.4 + \cdots + 0.1 \cdot 2^{n-1}
   \]
   The sum of the first \( n \) terms of a geometric series is given by:
   \[
   S_n = a \frac{r^n - 1}{r - 1}
   \]
   Substituting \( a = 0.1 \) and \( r = 2 \):
   \[
   C(n) = 0.1 \frac{2^n - 1}{2 - 1} = 0.1 (2^n - 1)
   \]

3. **Set up the inequality to find when Crocodile's earnings exceed Peter's:**
   We need to find the smallest \( n \) such that:
   \[
   C(n) > P(n)
   \]
   Substituting the expressions for \( C(n) \) and \( P(n) \):
   \[
   0.1 (2^n - 1) > 6.4n
   \]
   Simplifying:
   \[
   2^n - 1 > 64n
   \]
   \[
   2^n > 64n + 1
   \]

4. **Solve the inequality:**
   We need to find the smallest integer \( n \) for which \( 2^n > 64n + 1 \). We can test values of \( n \) to find the smallest solution:
   - For \( n = 1 \):
     \[
     2^1 = 2 \quad \text{and} \quad 64 \cdot 1 + 1 = 65 \quad \Rightarrow \quad 2 < 65
     \]
   - For \( n = 2 \):
     \[
     2^2 = 4 \quad \text{and} \quad 64 \cdot 2 + 1 = 129 \quad \Rightarrow \quad 4 < 129
     \]
   - For \( n = 3 \):
     \[
     2^3 = 8 \quad \text{and} \quad 64 \cdot 3 + 1 = 193 \quad \Rightarrow \quad 8 < 193
     \]
   - For \( n = 4 \):
     \[
     2^4 = 16 \quad \text{and} \quad 64 \cdot 4 + 1 = 257 \quad \Rightarrow \quad 16 < 257
     \]
   - For \( n = 5 \):
     \[
     2^5 = 32 \quad \text{and} \quad 64 \cdot 5 + 1 = 321 \quad \Rightarrow \quad 32 < 321
     \]
   - For \( n = 6 \):
     \[
     2^6 = 64 \quad \text{and} \quad 64 \cdot 6 + 1 = 385 \quad \Rightarrow \quad 64 < 385
     \]
   - For \( n = 7 \):
     \[
     2^7 = 128 \quad \text{and} \quad 64 \cdot 7 + 1 = 449 \quad \Rightarrow \quad 128 < 449
     \]
   - For \( n = 8 \):
     \[
     2^8 = 256 \quad \text{and} \quad 64 \cdot 8 + 1 = 513 \quad \Rightarrow \quad 256 < 513
     \]
   - For \( n = 9 \):
     \[
     2^9 = 512 \quad \text{and} \quad 64 \cdot 9 + 1 = 577 \quad \Rightarrow \quad 512 < 577
     \]
   - For \( n = 10 \):
     \[
     2^{10} = 1024 \quad \text{and} \quad 64 \cdot 10 + 1 = 641 \quad \Rightarrow \quad 1024 > 641
     \]

   Therefore, the smallest \( n \) for which \( 2^n > 64n + 1 \) is \( n = 10 \).

The final answer is \( \boxed{10} \)