Base | Representation |
---|---|
bin | 10110110000101010100001… |
… | …000100011101100111000011 |
3 | 111010102120201102222102200211 |
4 | 112300222201010131213003 |
5 | 101110024234241232321 |
6 | 552521505554254551 |
7 | 30041034205622443 |
oct | 2660524104354703 |
9 | 433376642872624 |
10 | 100101210102211 |
11 | 29993759518a4a |
12 | b288350887457 |
13 | 43b16715760a6 |
14 | 1aa0cd2872123 |
15 | b88cded8d0e1 |
hex | 5b0aa111d9c3 |
100101210102211 has 2 divisors, whose sum is σ = 100101210102212. Its totient is φ = 100101210102210.
The previous prime is 100101210102167. The next prime is 100101210102287. The reversal of 100101210102211 is 112201012101001.
It is a happy number.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 100101210102211 - 211 = 100101210100163 is a prime.
It is a super-2 number, since 2×1001012101022112 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 100101210102191 and 100101210102200.
It is not a weakly prime, because it can be changed into another prime (100101210109211) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50050605051105 + 50050605051106.
It is an arithmetic number, because the mean of its divisors is an integer number (50050605051106).
Almost surely, 2100101210102211 is an apocalyptic number.
100101210102211 is a deficient number, since it is larger than the sum of its proper divisors (1).
100101210102211 is an equidigital number, since it uses as much as digits as its factorization.
100101210102211 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 100101210102211 its reverse (112201012101001), we get a palindrome (212302222203212).
The spelling of 100101210102211 in words is "one hundred trillion, one hundred one billion, two hundred ten million, one hundred two thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •