Base | Representation |
---|---|
bin | 1010000011110101011100… |
… | …00101010101110101000101 |
3 | 2220022211202100222210001112 |
4 | 11001322232011111311011 |
5 | 10344421330031210432 |
6 | 115014412453534405 |
7 | 4442155560140435 |
oct | 501725605256505 |
9 | 86284670883045 |
10 | 22122002210117 |
11 | 705998558a047 |
12 | 2593485944405 |
13 | c461327a1784 |
14 | 5669d3d262c5 |
15 | 28569d9b67b2 |
hex | 141eae155d45 |
22122002210117 has 2 divisors, whose sum is σ = 22122002210118. Its totient is φ = 22122002210116.
The previous prime is 22122002210083. The next prime is 22122002210129. The reversal of 22122002210117 is 71101220022122.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 19447341487396 + 2674660722721 = 4409914^2 + 1635439^2 .
It is a cyclic number.
It is not a de Polignac number, because 22122002210117 - 224 = 22121985432901 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 22122002210092 and 22122002210101.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (22122002210617) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 11061001105058 + 11061001105059.
It is an arithmetic number, because the mean of its divisors is an integer number (11061001105059).
Almost surely, 222122002210117 is an apocalyptic number.
It is an amenable number.
22122002210117 is a deficient number, since it is larger than the sum of its proper divisors (1).
22122002210117 is an equidigital number, since it uses as much as digits as its factorization.
22122002210117 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 448, while the sum is 23.
Adding to 22122002210117 its reverse (71101220022122), we get a palindrome (93223222232239).
The spelling of 22122002210117 in words is "twenty-two trillion, one hundred twenty-two billion, two million, two hundred ten thousand, one hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •