Base | Representation |
---|---|
bin | 110000001101001010100110… |
… | …011001110101100000110101 |
3 | 1000210200001100211220122100102 |
4 | 300031022212121311200311 |
5 | 210242041430132041142 |
6 | 2030524254402123445 |
7 | 62441200262220026 |
oct | 6015124631654065 |
9 | 1023601324818312 |
10 | 212010967455797 |
11 | 6160a38a018004 |
12 | 1b941190050585 |
13 | 913b718c20083 |
14 | 3a4d558040c4d |
15 | 1979d59c71532 |
hex | c0d2a6675835 |
212010967455797 has 2 divisors, whose sum is σ = 212010967455798. Its totient is φ = 212010967455796.
The previous prime is 212010967455779. The next prime is 212010967455817. The reversal of 212010967455797 is 797554769010212.
Together with previous prime (212010967455779) 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., 194561182293361 + 17449785162436 = 13948519^2 + 4177294^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-212010967455797 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (212010967485797) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 106005483727898 + 106005483727899.
It is an arithmetic number, because the mean of its divisors is an integer number (106005483727899).
Almost surely, 2212010967455797 is an apocalyptic number.
It is an amenable number.
212010967455797 is a deficient number, since it is larger than the sum of its proper divisors (1).
212010967455797 is an equidigital number, since it uses as much as digits as its factorization.
212010967455797 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 66679200, while the sum is 65.
The spelling of 212010967455797 in words is "two hundred twelve trillion, ten billion, nine hundred sixty-seven million, four hundred fifty-five thousand, seven hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •