Base | Representation |
---|---|
bin | 1001001100100010011011… |
… | …1001010000110011001010 |
3 | 1022210121021100202222012210 |
4 | 2103020212321100303022 |
5 | 2311124314410410020 |
6 | 33300533135245550 |
7 | 2062332100133505 |
oct | 223104671206312 |
9 | 38717240688183 |
10 | 10111005560010 |
11 | 3249065055263 |
12 | 11736b73798b6 |
13 | 584604a8b244 |
14 | 26d537aaa13c |
15 | 1280254693e0 |
hex | 93226e50cca |
10111005560010 has 16 divisors (see below), whose sum is σ = 24266413344096. Its totient is φ = 2696268149328.
The previous prime is 10111005559979. The next prime is 10111005560077. The reversal of 10111005560010 is 1006550011101.
It is a happy number.
It is a super-2 number, since 2×101110055600102 (a number of 27 digits) contains 22 as substring.
It is a Curzon number.
It is an unprimeable number.
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, 168516759304 + ... + 168516759363.
It is an arithmetic number, because the mean of its divisors is an integer number (1516650834006).
Almost surely, 210111005560010 is an apocalyptic number.
10111005560010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
10111005560010 is an abundant number, since it is smaller than the sum of its proper divisors (14155407784086).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10111005560010 is a wasteful number, since it uses less digits than its factorization.
10111005560010 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 337033518677.
The product of its (nonzero) digits is 150, while the sum is 21.
Adding to 10111005560010 its reverse (1006550011101), we get a palindrome (11117555571111).
The spelling of 10111005560010 in words is "ten trillion, one hundred eleven billion, five million, five hundred sixty thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •