Base | Representation |
---|---|
bin | 10011110111001001… |
… | …11110011010110000 |
3 | 1000112010201221210120 |
4 | 21323210332122300 |
5 | 133314241200013 |
6 | 4522033530240 |
7 | 525146626362 |
oct | 117344763260 |
9 | 30463657716 |
10 | 10663225008 |
11 | 4582126857 |
12 | 2097113980 |
13 | 100c221bc7 |
14 | 732286d32 |
15 | 426219123 |
hex | 27b93e6b0 |
10663225008 has 40 divisors (see below), whose sum is σ = 27574090800. Its totient is φ = 3550869504.
The previous prime is 10663225007. The next prime is 10663225009. The reversal of 10663225008 is 80052236601.
It is an interprime number because it is at equal distance from previous prime (10663225007) and next prime (10663225009).
It is a super-2 number, since 2×106632250082 (a number of 21 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 10663225008.
It is not an unprimeable number, because it can be changed into a prime (10663225007) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 61653 + ... + 158516.
It is an arithmetic number, because the mean of its divisors is an integer number (689352270).
Almost surely, 210663225008 is an apocalyptic number.
It is an amenable number.
10663225008 is an abundant number, since it is smaller than the sum of its proper divisors (16910865792).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10663225008 is a wasteful number, since it uses less digits than its factorization.
10663225008 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 221189 (or 221183 counting only the distinct ones).
The product of its (nonzero) digits is 17280, while the sum is 33.
The spelling of 10663225008 in words is "ten billion, six hundred sixty-three million, two hundred twenty-five thousand, eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •