Base | Representation |
---|---|
bin | 1001001101000011111100… |
… | …1000000000001111001110 |
3 | 1022211110111100012002102102 |
4 | 2103100333020000033032 |
5 | 2311301231003341420 |
6 | 33305021552355102 |
7 | 2063101040540024 |
oct | 223207710001716 |
9 | 38743440162372 |
10 | 10120002012110 |
11 | 3251961342941 |
12 | 11753a8245a92 |
13 | 585409898693 |
14 | 26db4c83a714 |
15 | 1283a0194a75 |
hex | 9343f2003ce |
10120002012110 has 64 divisors (see below), whose sum is σ = 18914147481600. Its totient is φ = 3894405609600.
The previous prime is 10120002012091. The next prime is 10120002012149. The reversal of 10120002012110 is 1121020002101.
It is a super-2 number, since 2×101200020121102 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 10120002012091 and 10120002012100.
It is a congruent 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 31 ways as a sum of consecutive naturals, for example, 205787825 + ... + 205836995.
It is an arithmetic number, because the mean of its divisors is an integer number (295533554400).
Almost surely, 210120002012110 is an apocalyptic number.
10120002012110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
10120002012110 is a deficient number, since it is larger than the sum of its proper divisors (8794145469490).
10120002012110 is a wasteful number, since it uses less digits than its factorization.
10120002012110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 53097.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 10120002012110 its reverse (1121020002101), we get a palindrome (11241022014211).
The spelling of 10120002012110 in words is "ten trillion, one hundred twenty billion, two million, twelve thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •