Base | Representation |
---|---|
bin | 11001010010011… |
… | …10110101100101 |
3 | 112210011120212211 |
4 | 30221032311211 |
5 | 413301312034 |
6 | 33014443421 |
7 | 5154056113 |
oct | 1451166545 |
9 | 483146784 |
10 | 212135269 |
11 | a9821405 |
12 | 5b063571 |
13 | 34c45a38 |
14 | 20260ab3 |
15 | 13954d64 |
hex | ca4ed65 |
212135269 has 2 divisors, whose sum is σ = 212135270. Its totient is φ = 212135268.
The previous prime is 212135221. The next prime is 212135293. The reversal of 212135269 is 962531212.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 210540100 + 1595169 = 14510^2 + 1263^2 .
It is a cyclic number.
It is not a de Polignac number, because 212135269 - 217 = 212004197 is a prime.
It is a super-2 number, since 2×2121352692 = 90002744707404722, which contains 22 as substring.
It is equal to p11712865 and since 212135269 and 11712865 have the same sum of digits, it is a Honaker prime.
It is a self number, because there is not a number n which added to its sum of digits gives 212135269.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (212135569) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 106067634 + 106067635.
It is an arithmetic number, because the mean of its divisors is an integer number (106067635).
Almost surely, 2212135269 is an apocalyptic number.
It is an amenable number.
212135269 is a deficient number, since it is larger than the sum of its proper divisors (1).
212135269 is an equidigital number, since it uses as much as digits as its factorization.
212135269 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 6480, while the sum is 31.
The square root of 212135269 is about 14564.8641943549. The cubic root of 212135269 is about 596.3999884320.
The spelling of 212135269 in words is "two hundred twelve million, one hundred thirty-five thousand, two hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •