Base | Representation |
---|---|
bin | 101101011110101101000000… |
… | …011000110111000110110011 |
3 | 222020012220202020122200021011 |
4 | 231132231000120313012303 |
5 | 202204130030030413021 |
6 | 1545224501141011351 |
7 | 60063053452041244 |
oct | 5536550030670663 |
9 | 866186666580234 |
10 | 200022002201011 |
11 | 58807944752651 |
12 | 1a52572b9b3b57 |
13 | 877bcbc701933 |
14 | 375718bbb8ccb |
15 | 181d0709a4de1 |
hex | b5eb406371b3 |
200022002201011 has 2 divisors, whose sum is σ = 200022002201012. Its totient is φ = 200022002201010.
The previous prime is 200022002200921. The next prime is 200022002201023. The reversal of 200022002201011 is 110102200220002.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 200022002201011 - 27 = 200022002200883 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 200022002200982 and 200022002201000.
It is not a weakly prime, because it can be changed into another prime (200022002201051) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100011001100505 + 100011001100506.
It is an arithmetic number, because the mean of its divisors is an integer number (100011001100506).
Almost surely, 2200022002201011 is an apocalyptic number.
200022002201011 is a deficient number, since it is larger than the sum of its proper divisors (1).
200022002201011 is an equidigital number, since it uses as much as digits as its factorization.
200022002201011 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 32, while the sum is 13.
Adding to 200022002201011 its reverse (110102200220002), we get a palindrome (310124202421013).
The spelling of 200022002201011 in words is "two hundred trillion, twenty-two billion, two million, two hundred one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •