Base | Representation |
---|---|
bin | 1100010110110000011… |
… | …0010111101000011011 |
3 | 202021220020211011220011 |
4 | 3011230012113220123 |
5 | 11434210323201431 |
6 | 241303014342351 |
7 | 21223113533221 |
oct | 3055406275033 |
9 | 667806734804 |
10 | 212267006491 |
11 | 820272117a1 |
12 | 3517b95a9b7 |
13 | 1702a89c0b7 |
14 | a3b9364b11 |
15 | 57c5387cb1 |
hex | 316c197a1b |
212267006491 has 2 divisors, whose sum is σ = 212267006492. Its totient is φ = 212267006490.
The previous prime is 212267006447. The next prime is 212267006531. The reversal of 212267006491 is 194600762212.
212267006491 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an a-pointer prime, because the next prime (212267006531) can be obtained adding 212267006491 to its sum of digits (40).
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 212267006491 - 229 = 211730135579 is a prime.
It is a super-2 number, since 2×2122670064912 (a number of 23 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (212267009491) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 106133503245 + 106133503246.
It is an arithmetic number, because the mean of its divisors is an integer number (106133503246).
Almost surely, 2212267006491 is an apocalyptic number.
212267006491 is a deficient number, since it is larger than the sum of its proper divisors (1).
212267006491 is an equidigital number, since it uses as much as digits as its factorization.
212267006491 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 72576, while the sum is 40.
The spelling of 212267006491 in words is "two hundred twelve billion, two hundred sixty-seven million, six thousand, four hundred ninety-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •