Base | Representation |
---|---|
bin | 1111110100001… |
… | …1001011000101 |
3 | 11121211012002202 |
4 | 3331003023011 |
5 | 113440213204 |
6 | 10325444245 |
7 | 1433561516 |
oct | 375031305 |
9 | 147735082 |
10 | 66335429 |
11 | 34498876 |
12 | 1a270685 |
13 | 10987844 |
14 | 8b4aa0d |
15 | 5c54e1e |
hex | 3f432c5 |
66335429 has 2 divisors, whose sum is σ = 66335430. Its totient is φ = 66335428.
The previous prime is 66335393. The next prime is 66335447. The reversal of 66335429 is 92453366.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 65529025 + 806404 = 8095^2 + 898^2 .
It is a cyclic number.
It is not a de Polignac number, because 66335429 - 220 = 65286853 is a prime.
It is a super-2 number, since 2×663354292 = 8800778281228082, which contains 22 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is equal to p3914867 and since 66335429 and 3914867 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 = 66335392 and 66335401.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (66337429) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 33167714 + 33167715.
It is an arithmetic number, because the mean of its divisors is an integer number (33167715).
Almost surely, 266335429 is an apocalyptic number.
It is an amenable number.
66335429 is a deficient number, since it is larger than the sum of its proper divisors (1).
66335429 is an equidigital number, since it uses as much as digits as its factorization.
66335429 is an evil number, because the sum of its binary digits is even.
The product of its digits is 116640, while the sum is 38.
The square root of 66335429 is about 8144.6564691213. The cubic root of 66335429 is about 404.8074662765.
The spelling of 66335429 in words is "sixty-six million, three hundred thirty-five thousand, four hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •