Base | Representation |
---|---|
bin | 1010000110001010011110… |
… | …00010111011100000001101 |
3 | 2220121111021101202101100222 |
4 | 11003011033002323200031 |
5 | 10402224210100333401 |
6 | 115115244044001125 |
7 | 4451020362151151 |
oct | 503051702734015 |
9 | 86544241671328 |
10 | 22202012121101 |
11 | 708a90304541a |
12 | 25a6a94b301a5 |
13 | c50843996777 |
14 | 56a824121061 |
15 | 2877d2c91c1b |
hex | 14314f0bb80d |
22202012121101 has 2 divisors, whose sum is σ = 22202012121102. Its totient is φ = 22202012121100.
The previous prime is 22202012121097. The next prime is 22202012121127. The reversal of 22202012121101 is 10112121020222.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 22132310841001 + 69701280100 = 4704499^2 + 264010^2 .
It is a cyclic number.
It is not a de Polignac number, because 22202012121101 - 22 = 22202012121097 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 22202012121101.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (22202012121001) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 11101006060550 + 11101006060551.
It is an arithmetic number, because the mean of its divisors is an integer number (11101006060551).
Almost surely, 222202012121101 is an apocalyptic number.
It is an amenable number.
22202012121101 is a deficient number, since it is larger than the sum of its proper divisors (1).
22202012121101 is an equidigital number, since it uses as much as digits as its factorization.
22202012121101 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 64, while the sum is 17.
Adding to 22202012121101 its reverse (10112121020222), we get a palindrome (32314133141323).
The spelling of 22202012121101 in words is "twenty-two trillion, two hundred two billion, twelve million, one hundred twenty-one thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •