Base | Representation |
---|---|
bin | 10110110010010000110010… |
… | …010111111111011010001111 |
3 | 111010211002011102121220200011 |
4 | 112302100302113333122033 |
5 | 101113324133124200421 |
6 | 553044150310414051 |
7 | 30052002355326016 |
oct | 2662206227773217 |
9 | 433732142556604 |
10 | 100211022100111 |
11 | 29a2628a53031a |
12 | b2a5698661327 |
13 | 43bbb21b29a40 |
14 | 1aa634cab7a7d |
15 | b8baba6eb4e1 |
hex | 5b24325ff68f |
100211022100111 has 16 divisors (see below), whose sum is σ = 108099901099008. Its totient is φ = 92348033637600.
The previous prime is 100211022100051. The next prime is 100211022100153. The reversal of 100211022100111 is 111001220112001.
It is a happy number.
It is not a de Polignac number, because 100211022100111 - 29 = 100211022099599 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (13).
It is a junction number, because it is equal to n+sod(n) for n = 100211022100091 and 100211022100100.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100211022103111) 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, 16158606 + ... + 21483076.
It is an arithmetic number, because the mean of its divisors is an integer number (6756243818688).
Almost surely, 2100211022100111 is an apocalyptic number.
100211022100111 is a deficient number, since it is larger than the sum of its proper divisors (7888878998897).
100211022100111 is a wasteful number, since it uses less digits than its factorization.
100211022100111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5326902.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 100211022100111 its reverse (111001220112001), we get a palindrome (211212242212112).
The spelling of 100211022100111 in words is "one hundred trillion, two hundred eleven billion, twenty-two million, one hundred thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •