Base | Representation |
---|---|
bin | 101101111110011001011100… |
… | …011111000100100010011011 |
3 | 222111221010121012011211002111 |
4 | 231332121130133010202123 |
5 | 203000321121113310021 |
6 | 1554013224024213151 |
7 | 60406320016666654 |
oct | 5576313437044233 |
9 | 874833535154074 |
10 | 202200022010011 |
11 | 59477603098823 |
12 | 1a81787630a1b7 |
13 | 88a94c357a69c |
14 | 37d076748452b |
15 | 1859a473dc8e1 |
hex | b7e65c7c489b |
202200022010011 has 4 divisors (see below), whose sum is σ = 202200213287800. Its totient is φ = 202199830732224.
The previous prime is 202200022009961. The next prime is 202200022010057. The reversal of 202200022010011 is 110010220002202.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 202200022010011 - 227 = 202199887792283 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 202200022009973 and 202200022010000.
It is not an unprimeable number, because it can be changed into a prime (202200022010711) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 94044381 + ... + 96170398.
It is an arithmetic number, because the mean of its divisors is an integer number (50550053321950).
Almost surely, 2202200022010011 is an apocalyptic number.
202200022010011 is a deficient number, since it is larger than the sum of its proper divisors (191277789).
202200022010011 is a wasteful number, since it uses less digits than its factorization.
202200022010011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 191277788.
The product of its (nonzero) digits is 32, while the sum is 13.
Adding to 202200022010011 its reverse (110010220002202), we get a palindrome (312210242012213).
The spelling of 202200022010011 in words is "two hundred two trillion, two hundred billion, twenty-two million, ten thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •