Base | Representation |
---|---|
bin | 10110110010001000011001… |
… | …111011011010110001000011 |
3 | 111010210012221012101120210122 |
4 | 112302020121323122301003 |
5 | 101113202220114202321 |
6 | 553040101243450455 |
7 | 30051233342041604 |
oct | 2662103173326103 |
9 | 433705835346718 |
10 | 100202022022211 |
11 | 29a2249119660a |
12 | b2a39a6526a2b |
13 | 43bb019350165 |
14 | 1aa5b37681dab |
15 | b8b7405068ab |
hex | 5b2219edac43 |
100202022022211 has 2 divisors, whose sum is σ = 100202022022212. Its totient is φ = 100202022022210.
The previous prime is 100202022022183. The next prime is 100202022022273. The reversal of 100202022022211 is 112220220202001.
It is a happy number.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 100202022022211 - 242 = 95803975511107 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 100202022022211.
It is not a weakly prime, because it can be changed into another prime (100202022022111) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50101011011105 + 50101011011106.
It is an arithmetic number, because the mean of its divisors is an integer number (50101011011106).
Almost surely, 2100202022022211 is an apocalyptic number.
100202022022211 is a deficient number, since it is larger than the sum of its proper divisors (1).
100202022022211 is an equidigital number, since it uses as much as digits as its factorization.
100202022022211 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 128, while the sum is 17.
Adding to 100202022022211 its reverse (112220220202001), we get a palindrome (212422242224212).
The spelling of 100202022022211 in words is "one hundred trillion, two hundred two billion, twenty-two million, twenty-two thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •