Base | Representation |
---|---|
bin | 1111110110111… |
… | …0010100001001 |
3 | 11122011011111111 |
4 | 3331232110021 |
5 | 114011342022 |
6 | 10333330321 |
7 | 1435225636 |
oct | 375562411 |
9 | 148134444 |
10 | 66512137 |
11 | 345a960a |
12 | 1a3369a1 |
13 | 10a1a0c3 |
14 | 8b9518d |
15 | 5c8c477 |
hex | 3f6e509 |
66512137 has 2 divisors, whose sum is σ = 66512138. Its totient is φ = 66512136.
The previous prime is 66512119. The next prime is 66512153. The reversal of 66512137 is 73121566.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 38675961 + 27836176 = 6219^2 + 5276^2 .
It is a cyclic number.
It is not a de Polignac number, because 66512137 - 27 = 66512009 is a prime.
It is equal to p3924715 and since 66512137 and 3924715 have the same sum of digits, it is a Honaker prime.
It is a junction number, because it is equal to n+sod(n) for n = 66512099 and 66512108.
It is not a weakly prime, because it can be changed into another prime (66512107) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 33256068 + 33256069.
It is an arithmetic number, because the mean of its divisors is an integer number (33256069).
Almost surely, 266512137 is an apocalyptic number.
It is an amenable number.
66512137 is a deficient number, since it is larger than the sum of its proper divisors (1).
66512137 is an equidigital number, since it uses as much as digits as its factorization.
66512137 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 7560, while the sum is 31.
The square root of 66512137 is about 8155.4973484147. The cubic root of 66512137 is about 405.1665971113.
The spelling of 66512137 in words is "sixty-six million, five hundred twelve thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •