Base | Representation |
---|---|
bin | 1001001011111101111010… |
… | …0000010000110000111000 |
3 | 1022202122222001222102011011 |
4 | 2102333132200100300320 |
5 | 2310444224441041440 |
6 | 33252232220043304 |
7 | 2061534115532356 |
oct | 222773640206070 |
9 | 38678861872134 |
10 | 10101201112120 |
11 | 3244993765468 |
12 | 117181b993534 |
13 | 58370175b6a1 |
14 | 26cc878cc7d6 |
15 | 127b4e8379ea |
hex | 92fde810c38 |
10101201112120 has 32 divisors (see below), whose sum is σ = 22764778744320. Its totient is φ = 4033889112960.
The previous prime is 10101201112109. The next prime is 10101201112139. The reversal of 10101201112120 is 2121110210101.
It is a happy number.
It is a self number, because there is not a number n which added to its sum of digits gives 10101201112120.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 205954296 + ... + 206003335.
It is an arithmetic number, because the mean of its divisors is an integer number (711399335760).
Almost surely, 210101201112120 is an apocalyptic number.
10101201112120 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10101201112120 is an abundant number, since it is smaller than the sum of its proper divisors (12663577632200).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10101201112120 is a wasteful number, since it uses less digits than its factorization.
10101201112120 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 411958255 (or 411958251 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 10101201112120 its reverse (2121110210101), we get a palindrome (12222311322221).
The spelling of 10101201112120 in words is "ten trillion, one hundred one billion, two hundred one million, one hundred twelve thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •