Base | Representation |
---|---|
bin | 101101011110101101000110… |
… | …111000010110111000001111 |
3 | 222020012221000211121101021112 |
4 | 231132231012320112320033 |
5 | 202204130240421332121 |
6 | 1545224520031322235 |
7 | 60063056243614052 |
oct | 5536550670267017 |
9 | 866187024541245 |
10 | 200022111120911 |
11 | 588079a01867a2 |
12 | 1a52576038037b |
13 | 877c009149491 |
14 | 375719c44ca99 |
15 | 181d07a31c75b |
hex | b5eb46e16e0f |
200022111120911 has 2 divisors, whose sum is σ = 200022111120912. Its totient is φ = 200022111120910.
The previous prime is 200022111120833. The next prime is 200022111120971. The reversal of 200022111120911 is 119021111220002.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 200022111120911 - 214 = 200022111104527 is a prime.
It is a super-2 number, since 2×2000221111209112 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (200022111120971) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100011055560455 + 100011055560456.
It is an arithmetic number, because the mean of its divisors is an integer number (100011055560456).
Almost surely, 2200022111120911 is an apocalyptic number.
200022111120911 is a deficient number, since it is larger than the sum of its proper divisors (1).
200022111120911 is an equidigital number, since it uses as much as digits as its factorization.
200022111120911 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 144, while the sum is 23.
Adding to 200022111120911 its reverse (119021111220002), we get a palindrome (319043222340913).
The spelling of 200022111120911 in words is "two hundred trillion, twenty-two billion, one hundred eleven million, one hundred twenty thousand, nine hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •