Base | Representation |
---|---|
bin | 1010000110011101000100… |
… | …11011110111100100100101 |
3 | 2220122110001112210012021211 |
4 | 11003032202123313210211 |
5 | 10402410134240231432 |
6 | 115124015154311421 |
7 | 4451523044120611 |
oct | 503164233674445 |
9 | 86573045705254 |
10 | 22212001102117 |
11 | 7094069613732 |
12 | 25a8a02288571 |
13 | c517762c6618 |
14 | 56b0d0a16341 |
15 | 287bb9bc4d47 |
hex | 1433a26f7925 |
22212001102117 has 2 divisors, whose sum is σ = 22212001102118. Its totient is φ = 22212001102116.
The previous prime is 22212001102061. The next prime is 22212001102133. The reversal of 22212001102117 is 71120110021222.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 20105413016836 + 2106588085281 = 4483906^2 + 1451409^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-22212001102117 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (22212001106117) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 11106000551058 + 11106000551059.
It is an arithmetic number, because the mean of its divisors is an integer number (11106000551059).
Almost surely, 222212001102117 is an apocalyptic number.
It is an amenable number.
22212001102117 is a deficient number, since it is larger than the sum of its proper divisors (1).
22212001102117 is an equidigital number, since it uses as much as digits as its factorization.
22212001102117 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 224, while the sum is 22.
Adding to 22212001102117 its reverse (71120110021222), we get a palindrome (93332111123339).
The spelling of 22212001102117 in words is "twenty-two trillion, two hundred twelve billion, one million, one hundred two thousand, one hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •