Base | Representation |
---|---|
bin | 100000010101100000110… |
… | …011011111001110001101 |
3 | 21212102200111221211120012 |
4 | 200111200303133032031 |
5 | 242401401240430442 |
6 | 4420455010403005 |
7 | 316354155032555 |
oct | 40254063371615 |
9 | 7772614854505 |
10 | 2222122201997 |
11 | 787440063855 |
12 | 2ba7b4290465 |
13 | 131711b207a9 |
14 | 797a0a42165 |
15 | 3cc0866d582 |
hex | 20560cdf38d |
2222122201997 has 2 divisors, whose sum is σ = 2222122201998. Its totient is φ = 2222122201996.
The previous prime is 2222122201979. The next prime is 2222122202099. The reversal of 2222122201997 is 7991022212222.
Together with previous prime (2222122201979) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 2201962177801 + 20160024196 = 1483901^2 + 141986^2 .
It is a cyclic number.
It is not a de Polignac number, because 2222122201997 - 210 = 2222122200973 is a prime.
It is a super-3 number, since 3×22221222019973 (a number of 38 digits) contains 333 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2222122201907) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1111061100998 + 1111061100999.
It is an arithmetic number, because the mean of its divisors is an integer number (1111061100999).
Almost surely, 22222122201997 is an apocalyptic number.
It is an amenable number.
2222122201997 is a deficient number, since it is larger than the sum of its proper divisors (1).
2222122201997 is an equidigital number, since it uses as much as digits as its factorization.
2222122201997 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 72576, while the sum is 41.
The spelling of 2222122201997 in words is "two trillion, two hundred twenty-two billion, one hundred twenty-two million, two hundred one thousand, nine hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •