Base | Representation |
---|---|
bin | 1001001100100110100101… |
… | …1000101101111010110000 |
3 | 1022210201011002212101010210 |
4 | 2103021221120231322300 |
5 | 2311134111000231000 |
6 | 33301235545224120 |
7 | 2062401534110511 |
oct | 223115130557260 |
9 | 38721132771123 |
10 | 10112121102000 |
11 | 3249587815495 |
12 | 1173968a92040 |
13 | 584751c21168 |
14 | 26d601cd2a08 |
15 | 12808d370350 |
hex | 9326962deb0 |
10112121102000 has 80 divisors (see below), whose sum is σ = 32601478452192. Its totient is φ = 2696565625600.
The previous prime is 10112121101977. The next prime is 10112121102007. The reversal of 10112121102000 is 20112121101.
It is a tau number, because it is divible by the number of its divisors (80).
It is a Harshad number since it is a multiple of its sum of digits (12).
It is not an unprimeable number, because it can be changed into a prime (10112121102007) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 842670759 + ... + 842682758.
Almost surely, 210112121102000 is an apocalyptic number.
10112121102000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10112121102000 is an abundant number, since it is smaller than the sum of its proper divisors (22489357350192).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10112121102000 is a wasteful number, since it uses less digits than its factorization.
10112121102000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1685353543 (or 1685353527 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 10112121102000 its reverse (20112121101), we get a palindrome (10132233223101).
The spelling of 10112121102000 in words is "ten trillion, one hundred twelve billion, one hundred twenty-one million, one hundred two thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •