Base | Representation |
---|---|
bin | 1001001011111101100110… |
… | …1011101011111110111000 |
3 | 1022202122202102202201112220 |
4 | 2102333121223223332320 |
5 | 2310444043234033422 |
6 | 33252220210204040 |
7 | 2061532114135464 |
oct | 222773153537670 |
9 | 38678672681486 |
10 | 10101120221112 |
11 | 3244952035898 |
12 | 11717b8883620 |
13 | 5836baa7889b |
14 | 26cc7ac734a4 |
15 | 127b476a9e5c |
hex | 92fd9aebfb8 |
10101120221112 has 32 divisors (see below), whose sum is σ = 25840074986880. Its totient is φ = 3288736815840.
The previous prime is 10101120221053. The next prime is 10101120221131. The reversal of 10101120221112 is 21112202110101.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 10101120221091 and 10101120221100.
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, 4893952564 + ... + 4893954627.
It is an arithmetic number, because the mean of its divisors is an integer number (807502343340).
Almost surely, 210101120221112 is an apocalyptic number.
10101120221112 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
10101120221112 is an abundant number, since it is smaller than the sum of its proper divisors (15738954765768).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10101120221112 is a wasteful number, since it uses less digits than its factorization.
10101120221112 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 9787907243 (or 9787907239 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 10101120221112 its reverse (21112202110101), we get a palindrome (31213322331213).
The spelling of 10101120221112 in words is "ten trillion, one hundred one billion, one hundred twenty million, two hundred twenty-one thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •