Base | Representation |
---|---|
bin | 1010000011110011111101… |
… | …11011011111110000110101 |
3 | 2220022202201020101020021201 |
4 | 11001321332323133300311 |
5 | 10344413220020201323 |
6 | 115014202153412501 |
7 | 4442130142621531 |
oct | 501717673376065 |
9 | 86282636336251 |
10 | 22121211100213 |
11 | 7059609a70505 |
12 | 25932a4a0a131 |
13 | c460379121c4 |
14 | 56695ac32bc1 |
15 | 2856542e88ad |
hex | 141e7eedfc35 |
22121211100213 has 2 divisors, whose sum is σ = 22121211100214. Its totient is φ = 22121211100212.
The previous prime is 22121211100211. The next prime is 22121211100223. The reversal of 22121211100213 is 31200111212122.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 16145151718609 + 5976059381604 = 4018103^2 + 2444598^2 .
It is a cyclic number.
It is not a de Polignac number, because 22121211100213 - 21 = 22121211100211 is a prime.
Together with 22121211100211, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (22121211100211) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 11060605550106 + 11060605550107.
It is an arithmetic number, because the mean of its divisors is an integer number (11060605550107).
Almost surely, 222121211100213 is an apocalyptic number.
It is an amenable number.
22121211100213 is a deficient number, since it is larger than the sum of its proper divisors (1).
22121211100213 is an equidigital number, since it uses as much as digits as its factorization.
22121211100213 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 96, while the sum is 19.
Adding to 22121211100213 its reverse (31200111212122), we get a palindrome (53321322312335).
The spelling of 22121211100213 in words is "twenty-two trillion, one hundred twenty-one billion, two hundred eleven million, one hundred thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •