Base | Representation |
---|---|
bin | 100000001100000110001… |
… | …001001010000000000101 |
3 | 21211110120212100210010102 |
4 | 200030012021022000011 |
5 | 242220144333032442 |
6 | 4412103421133445 |
7 | 315545462102054 |
oct | 40140611120005 |
9 | 7743525323112 |
10 | 2212011220997 |
11 | 783121738106 |
12 | 2b88520ba285 |
13 | 1307901465b6 |
14 | 790c1c7039b |
15 | 3c815b8c232 |
hex | 2030624a005 |
2212011220997 has 2 divisors, whose sum is σ = 2212011220998. Its totient is φ = 2212011220996.
The previous prime is 2212011220901. The next prime is 2212011221027. The reversal of 2212011220997 is 7990221102122.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2059035584356 + 152975636641 = 1434934^2 + 391121^2 .
It is a cyclic number.
It is not a de Polignac number, because 2212011220997 - 210 = 2212011219973 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 2212011220997.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2212011220297) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1106005610498 + 1106005610499.
It is an arithmetic number, because the mean of its divisors is an integer number (1106005610499).
Almost surely, 22212011220997 is an apocalyptic number.
It is an amenable number.
2212011220997 is a deficient number, since it is larger than the sum of its proper divisors (1).
2212011220997 is an equidigital number, since it uses as much as digits as its factorization.
2212011220997 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 18144, while the sum is 38.
The spelling of 2212011220997 in words is "two trillion, two hundred twelve billion, eleven million, two hundred twenty thousand, nine hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •