Base | Representation |
---|---|
bin | 10001110010010001111… |
… | …111101101100010101101 |
3 | 11022211202121202122121101 |
4 | 101302101333231202231 |
5 | 130011101322004442 |
6 | 2333251414403101 |
7 | 154205516343565 |
oct | 21622177554255 |
9 | 4284677678541 |
10 | 1222220109997 |
11 | 431382430667 |
12 | 178a5b060491 |
13 | 8b340c154a3 |
14 | 43227603da5 |
15 | 21bd57e6cb7 |
hex | 11c91fed8ad |
1222220109997 has 2 divisors, whose sum is σ = 1222220109998. Its totient is φ = 1222220109996.
The previous prime is 1222220109959. The next prime is 1222220110043. The reversal of 1222220109997 is 7999010222221.
It is an a-pointer prime, because the next prime (1222220110043) can be obtained adding 1222220109997 to its sum of digits (46).
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 815506526916 + 406713583081 = 903054^2 + 637741^2 .
It is a cyclic number.
It is not a de Polignac number, because 1222220109997 - 219 = 1222219585709 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1222220109497) 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, 611110054998 + 611110054999.
It is an arithmetic number, because the mean of its divisors is an integer number (611110054999).
Almost surely, 21222220109997 is an apocalyptic number.
It is an amenable number.
1222220109997 is a deficient number, since it is larger than the sum of its proper divisors (1).
1222220109997 is an equidigital number, since it uses as much as digits as its factorization.
1222220109997 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 163296, while the sum is 46.
The spelling of 1222220109997 in words is "one trillion, two hundred twenty-two billion, two hundred twenty million, one hundred nine thousand, nine hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •