Base | Representation |
---|---|
bin | 1010000110000111000111… |
… | …01100010001100101000101 |
3 | 2220121022121212122222021112 |
4 | 11003003203230101211011 |
5 | 10402212013010120401 |
6 | 115114345224054405 |
7 | 4450624632066632 |
oct | 503034354214505 |
9 | 86538555588245 |
10 | 22200211020101 |
11 | 708a0693a95a4 |
12 | 25a6671904405 |
13 | c506177ac52a |
14 | 56a6d2c3d189 |
15 | 287729abc3bb |
hex | 1430e3b11945 |
22200211020101 has 2 divisors, whose sum is σ = 22200211020102. Its totient is φ = 22200211020100.
The previous prime is 22200211020041. The next prime is 22200211020137. The reversal of 22200211020101 is 10102011200222.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 12376844669476 + 9823366350625 = 3518074^2 + 3134225^2 .
It is a cyclic number.
It is not a de Polignac number, because 22200211020101 - 230 = 22199137278277 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (22200211020901) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 11100105510050 + 11100105510051.
It is an arithmetic number, because the mean of its divisors is an integer number (11100105510051).
Almost surely, 222200211020101 is an apocalyptic number.
It is an amenable number.
22200211020101 is a deficient number, since it is larger than the sum of its proper divisors (1).
22200211020101 is an equidigital number, since it uses as much as digits as its factorization.
22200211020101 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 14.
Adding to 22200211020101 its reverse (10102011200222), we get a palindrome (32302222220323).
The spelling of 22200211020101 in words is "twenty-two trillion, two hundred billion, two hundred eleven million, twenty thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •