Base | Representation |
---|---|
bin | 10010101000100100… |
… | …11110100010110001 |
3 | 221211012102010110221 |
4 | 21110102132202301 |
5 | 130442020030213 |
6 | 4332405453041 |
7 | 502624100416 |
oct | 112422364261 |
9 | 27735363427 |
10 | 10004064433 |
11 | 4274040750 |
12 | 1b32411181 |
13 | c357b146c |
14 | 6ac90010d |
15 | 3d841238d |
hex | 25449e8b1 |
10004064433 has 32 divisors (see below), whose sum is σ = 11679897600. Its totient is φ = 8472859200.
The previous prime is 10004064419. The next prime is 10004064461. The reversal of 10004064433 is 33446040001.
It is a happy number.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10004064433 is a prime.
It is a super-2 number, since 2×100040644332 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10004064398 and 10004064407.
It is not an unprimeable number, because it can be changed into a prime (10004062433) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 4671543 + ... + 4673683.
It is an arithmetic number, because the mean of its divisors is an integer number (364996800).
Almost surely, 210004064433 is an apocalyptic number.
It is an amenable number.
10004064433 is a deficient number, since it is larger than the sum of its proper divisors (1675833167).
10004064433 is a wasteful number, since it uses less digits than its factorization.
10004064433 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2533.
The product of its (nonzero) digits is 3456, while the sum is 25.
The spelling of 10004064433 in words is "ten billion, four million, sixty-four thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •