Base | Representation |
---|---|
bin | 1010000110101110000010… |
… | …11011011000010000000101 |
3 | 2220200022120102200001202112 |
4 | 11003113001123120100011 |
5 | 10403032313404031432 |
6 | 115132123143150405 |
7 | 4452264563026046 |
oct | 503270133302005 |
9 | 86608512601675 |
10 | 22221111002117 |
11 | 7097a13948405 |
12 | 25aa725145405 |
13 | c525987755b1 |
14 | 56b7168788cd |
15 | 28804e85e7b2 |
hex | 1435c16d8405 |
22221111002117 has 2 divisors, whose sum is σ = 22221111002118. Its totient is φ = 22221111002116.
The previous prime is 22221111002113. The next prime is 22221111002227. The reversal of 22221111002117 is 71120011112222.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 13839396977956 + 8381714024161 = 3720134^2 + 2895119^2 .
It is a cyclic number.
It is not a de Polignac number, because 22221111002117 - 22 = 22221111002113 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 22221111002092 and 22221111002101.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (22221111002113) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 11110555501058 + 11110555501059.
It is an arithmetic number, because the mean of its divisors is an integer number (11110555501059).
Almost surely, 222221111002117 is an apocalyptic number.
It is an amenable number.
22221111002117 is a deficient number, since it is larger than the sum of its proper divisors (1).
22221111002117 is an equidigital number, since it uses as much as digits as its factorization.
22221111002117 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 224, while the sum is 23.
Adding to 22221111002117 its reverse (71120011112222), we get a palindrome (93341122114339).
The spelling of 22221111002117 in words is "twenty-two trillion, two hundred twenty-one billion, one hundred eleven million, two thousand, one hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •