Base | Representation |
---|---|
bin | 10100100101010100… |
… | …101001001100111101 |
3 | 2010001020221101110002 |
4 | 110211110221030331 |
5 | 330230324130432 |
6 | 14053021124045 |
7 | 1411453305152 |
oct | 244524511475 |
9 | 63036841402 |
10 | 22101005117 |
11 | 9411494294 |
12 | 43496b9625 |
13 | 2112a58129 |
14 | 10d9354229 |
15 | 895430e62 |
hex | 52552933d |
22101005117 has 2 divisors, whose sum is σ = 22101005118. Its totient is φ = 22101005116.
The previous prime is 22101005111. The next prime is 22101005137. The reversal of 22101005117 is 71150010122.
It is a happy number.
It is an a-pointer prime, because the next prime (22101005137) can be obtained adding 22101005117 to its sum of digits (20).
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 19728730681 + 2372274436 = 140459^2 + 48706^2 .
It is a cyclic number.
It is not a de Polignac number, because 22101005117 - 26 = 22101005053 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (22101005111) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 11050502558 + 11050502559.
It is an arithmetic number, because the mean of its divisors is an integer number (11050502559).
Almost surely, 222101005117 is an apocalyptic number.
It is an amenable number.
22101005117 is a deficient number, since it is larger than the sum of its proper divisors (1).
22101005117 is an equidigital number, since it uses as much as digits as its factorization.
22101005117 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 140, while the sum is 20.
Adding to 22101005117 its reverse (71150010122), we get a palindrome (93251015239).
The spelling of 22101005117 in words is "twenty-two billion, one hundred one million, five thousand, one hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •