Base | Representation |
---|---|
bin | 1010111010100100010100… |
… | …1110010101110001001110 |
3 | 1120111022110020021120011010 |
4 | 2232221011032111301032 |
5 | 3033112130300341420 |
6 | 41305153205510050 |
7 | 2346031254643203 |
oct | 256510516256116 |
9 | 46438406246133 |
10 | 12001300012110 |
11 | 39077a4a90182 |
12 | 1419b23112326 |
13 | 690943b30216 |
14 | 2d6c1a503caa |
15 | 15c2ac1144e0 |
hex | aea45395c4e |
12001300012110 has 64 divisors (see below), whose sum is σ = 29495543280192. Its totient is φ = 3124023791616.
The previous prime is 12001300012103. The next prime is 12001300012213. The reversal of 12001300012110 is 1121000310021.
12001300012110 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×120013000121102 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 18844099 + ... + 19470558.
It is an arithmetic number, because the mean of its divisors is an integer number (460867863753).
Almost surely, 212001300012110 is an apocalyptic number.
12001300012110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
12001300012110 is an abundant number, since it is smaller than the sum of its proper divisors (17494243268082).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12001300012110 is a wasteful number, since it uses less digits than its factorization.
12001300012110 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 38314917.
The product of its (nonzero) digits is 12, while the sum is 12.
Adding to 12001300012110 its reverse (1121000310021), we get a palindrome (13122300322131).
The spelling of 12001300012110 in words is "twelve trillion, one billion, three hundred million, twelve thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •