Base | Representation |
---|---|
bin | 1010000110001010011101… |
… | …11111011101010111000001 |
3 | 2220121111021100001011012222 |
4 | 11003011032333131113001 |
5 | 10402224204332224301 |
6 | 115115244012300425 |
7 | 4451020351341323 |
oct | 503051677352701 |
9 | 86544240034188 |
10 | 22202011211201 |
11 | 708a902583838 |
12 | 25a6a94771715 |
13 | c50843738573 |
14 | 56a823d65613 |
15 | 2877d2b6231b |
hex | 14314efdd5c1 |
22202011211201 has 2 divisors, whose sum is σ = 22202011211202. Its totient is φ = 22202011211200.
The previous prime is 22202011211129. The next prime is 22202011211221. The reversal of 22202011211201 is 10211211020222.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 16114323490225 + 6087687720976 = 4014265^2 + 2467324^2 .
It is a cyclic number.
It is not a de Polignac number, because 22202011211201 - 230 = 22200937469377 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 22202011211201.
It is not a weakly prime, because it can be changed into another prime (22202011211221) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 11101005605600 + 11101005605601.
It is an arithmetic number, because the mean of its divisors is an integer number (11101005605601).
Almost surely, 222202011211201 is an apocalyptic number.
It is an amenable number.
22202011211201 is a deficient number, since it is larger than the sum of its proper divisors (1).
22202011211201 is an equidigital number, since it uses as much as digits as its factorization.
22202011211201 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 22202011211201 its reverse (10211211020222), we get a palindrome (32413222231423).
The spelling of 22202011211201 in words is "twenty-two trillion, two hundred two billion, eleven million, two hundred eleven thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •