Base | Representation |
---|---|
bin | 1001001100100010110100… |
… | …1111010110000110110011 |
3 | 1022210121112210002022011220 |
4 | 2103020231033112012303 |
5 | 2311130024133342321 |
6 | 33300551501040123 |
7 | 2062334532021000 |
oct | 223105517260663 |
9 | 38717483068156 |
10 | 10111112012211 |
11 | 324910a153391 |
12 | 1173726b56043 |
13 | 584620b50802 |
14 | 26d547c9a8a7 |
15 | 12802e9959c6 |
hex | 9322d3d61b3 |
10111112012211 has 128 divisors (see below), whose sum is σ = 16301481984000. Its totient is φ = 5568704991360.
The previous prime is 10111112012207. The next prime is 10111112012219. The reversal of 10111112012211 is 11221021111101.
10111112012211 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 10111112012211 - 22 = 10111112012207 is a prime.
It is a super-2 number, since 2×101111120122112 (a number of 27 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (10111112012219) by changing a digit.
It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 5868317196 + ... + 5868318918.
It is an arithmetic number, because the mean of its divisors is an integer number (127355328000).
Almost surely, 210111112012211 is an apocalyptic number.
10111112012211 is a deficient number, since it is larger than the sum of its proper divisors (6190369971789).
10111112012211 is a wasteful number, since it uses less digits than its factorization.
10111112012211 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3574 (or 3560 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 15.
Adding to 10111112012211 its reverse (11221021111101), we get a palindrome (21332133123312).
The spelling of 10111112012211 in words is "ten trillion, one hundred eleven billion, one hundred twelve million, twelve thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •