Base | Representation |
---|---|
bin | 1001000110001101000110… |
… | …0101110000011110010111 |
3 | 1022102012102112022001100102 |
4 | 2101203101211300132113 |
5 | 2302334001222413421 |
6 | 33134540343004315 |
7 | 2051430562631636 |
oct | 221432145603627 |
9 | 38365375261312 |
10 | 10002200201111 |
11 | 3206a00290748 |
12 | 11565b073969b |
13 | 577284c2a581 |
14 | 26817541d51d |
15 | 1252a819e60b |
hex | 918d1970797 |
10002200201111 has 2 divisors, whose sum is σ = 10002200201112. Its totient is φ = 10002200201110.
The previous prime is 10002200201107. The next prime is 10002200201131. The reversal of 10002200201111 is 11110200220001.
It is a weak prime.
It is an emirp because it is prime and its reverse (11110200220001) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 10002200201111 - 22 = 10002200201107 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 10002200201092 and 10002200201101.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10002200201131) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5001100100555 + 5001100100556.
It is an arithmetic number, because the mean of its divisors is an integer number (5001100100556).
Almost surely, 210002200201111 is an apocalyptic number.
10002200201111 is a deficient number, since it is larger than the sum of its proper divisors (1).
10002200201111 is an equidigital number, since it uses as much as digits as its factorization.
10002200201111 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 10002200201111 its reverse (11110200220001), we get a palindrome (21112400421112).
The spelling of 10002200201111 in words is "ten trillion, two billion, two hundred million, two hundred one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •