Base | Representation |
---|---|
bin | 10010101000110001… |
… | …00011010001001010 |
3 | 221211022102000120221 |
4 | 21110120203101022 |
5 | 130442422003100 |
6 | 4332503540254 |
7 | 502643451433 |
oct | 112430432112 |
9 | 27738360527 |
10 | 10005656650 |
11 | 4274a28a30 |
12 | 1b32a5a68a |
13 | c35c1b0c2 |
14 | 6acbd648a |
15 | 3d862901a |
hex | 25462344a |
10005656650 has 48 divisors (see below), whose sum is σ = 21185126208. Its totient is φ = 3480224000.
The previous prime is 10005656641. The next prime is 10005656693. The reversal of 10005656650 is 5665650001.
It is a super-2 number, since 2×100056566502 (a number of 21 digits) contains 22 as substring.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 382831 + ... + 408130.
It is an arithmetic number, because the mean of its divisors is an integer number (441356796).
Almost surely, 210005656650 is an apocalyptic number.
10005656650 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
10005656650 is an abundant number, since it is smaller than the sum of its proper divisors (11179469558).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10005656650 is a wasteful number, since it uses less digits than its factorization.
10005656650 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 791007 (or 791002 counting only the distinct ones).
The product of its (nonzero) digits is 27000, while the sum is 34.
The spelling of 10005656650 in words is "ten billion, five million, six hundred fifty-six thousand, six hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •