Base | Representation |
---|---|
bin | 10110110010000110101110… |
… | …100001101011100100111011 |
3 | 111010210001021121210010100021 |
4 | 112302012232201223210323 |
5 | 101113140022322110321 |
6 | 553035202354351311 |
7 | 30051140602053601 |
oct | 2662065641534473 |
9 | 433701247703307 |
10 | 100200220113211 |
11 | 29a21747048719 |
12 | b2a3582b8b537 |
13 | 43baabcc4220a |
14 | 1aa5a0622d871 |
15 | b8b687222941 |
hex | 5b21ae86b93b |
100200220113211 has 2 divisors, whose sum is σ = 100200220113212. Its totient is φ = 100200220113210.
The previous prime is 100200220113127. The next prime is 100200220113221. The reversal of 100200220113211 is 112311022002001.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-100200220113211 is a prime.
It is a super-2 number, since 2×1002002201132112 (a number of 29 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (100200220113221) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50100110056605 + 50100110056606.
It is an arithmetic number, because the mean of its divisors is an integer number (50100110056606).
Almost surely, 2100200220113211 is an apocalyptic number.
100200220113211 is a deficient number, since it is larger than the sum of its proper divisors (1).
100200220113211 is an equidigital number, since it uses as much as digits as its factorization.
100200220113211 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 48, while the sum is 16.
Adding to 100200220113211 its reverse (112311022002001), we get a palindrome (212511242115212).
The spelling of 100200220113211 in words is "one hundred trillion, two hundred billion, two hundred twenty million, one hundred thirteen thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •