Base | Representation |
---|---|
bin | 11001010011000… |
… | …00000111110101 |
3 | 112210022012000001 |
4 | 30221200013311 |
5 | 413311043234 |
6 | 33020151301 |
7 | 5154502405 |
oct | 1451400765 |
9 | 483265001 |
10 | 212206069 |
11 | a986a619 |
12 | 5b098531 |
13 | 34c6c02a |
14 | 2027c805 |
15 | 1396ad14 |
hex | ca601f5 |
212206069 has 2 divisors, whose sum is σ = 212206070. Its totient is φ = 212206068.
The previous prime is 212206031. The next prime is 212206097. The reversal of 212206069 is 960602212.
It is an a-pointer prime, because the next prime (212206097) can be obtained adding 212206069 to its sum of digits (28).
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 204861969 + 7344100 = 14313^2 + 2710^2 .
It is a cyclic number.
It is not a de Polignac number, because 212206069 - 27 = 212205941 is a prime.
It is a super-2 number, since 2×2122060692 = 90062831440865522, which contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (212206669) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 106103034 + 106103035.
It is an arithmetic number, because the mean of its divisors is an integer number (106103035).
Almost surely, 2212206069 is an apocalyptic number.
It is an amenable number.
212206069 is a deficient number, since it is larger than the sum of its proper divisors (1).
212206069 is an equidigital number, since it uses as much as digits as its factorization.
212206069 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2592, while the sum is 28.
The square root of 212206069 is about 14567.2944982931. The cubic root of 212206069 is about 596.4663304139.
The spelling of 212206069 in words is "two hundred twelve million, two hundred six thousand, sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.024 sec. • engine limits •