Base | Representation |
---|---|
bin | 1111110101010… |
… | …1111110010001 |
3 | 11121222002201202 |
4 | 3331111332101 |
5 | 114000144213 |
6 | 10331240545 |
7 | 1434332153 |
oct | 375257621 |
9 | 147862652 |
10 | 66412433 |
11 | 3454070a |
12 | 1a2a9155 |
13 | 109b38c9 |
14 | 8b6aad3 |
15 | 5c6cb58 |
hex | 3f55f91 |
66412433 has 2 divisors, whose sum is σ = 66412434. Its totient is φ = 66412432.
The previous prime is 66412397. The next prime is 66412441. The reversal of 66412433 is 33421466.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 50794129 + 15618304 = 7127^2 + 3952^2 .
It is a cyclic number.
It is not a de Polignac number, because 66412433 - 210 = 66411409 is a prime.
It is a super-2 number, since 2×664124332 = 8821222513958978, which contains 22 as substring.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 66412396 and 66412405.
It is not a weakly prime, because it can be changed into another prime (66412033) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 33206216 + 33206217.
It is an arithmetic number, because the mean of its divisors is an integer number (33206217).
Almost surely, 266412433 is an apocalyptic number.
It is an amenable number.
66412433 is a deficient number, since it is larger than the sum of its proper divisors (1).
66412433 is an equidigital number, since it uses as much as digits as its factorization.
66412433 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 10368, while the sum is 29.
The square root of 66412433 is about 8149.3823692351. The cubic root of 66412433 is about 404.9640429389.
Adding to 66412433 its reverse (33421466), we get a palindrome (99833899).
The spelling of 66412433 in words is "sixty-six million, four hundred twelve thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •