Base | Representation |
---|---|
bin | 1111110010001… |
… | …1111011000111 |
3 | 11121120200112002 |
4 | 3330203323013 |
5 | 113422114211 |
6 | 10323015515 |
7 | 1432516403 |
oct | 374437307 |
9 | 147520462 |
10 | 66207431 |
11 | 34410694 |
12 | 1a20a59b |
13 | 109414c4 |
14 | 8b16103 |
15 | 5c2c03b |
hex | 3f23ec7 |
66207431 has 2 divisors, whose sum is σ = 66207432. Its totient is φ = 66207430.
The previous prime is 66207397. The next prime is 66207439. The reversal of 66207431 is 13470266.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 66207431 - 210 = 66206407 is a prime.
It is a super-2 number, since 2×662074312 = 8766847839239522, which contains 22 as substring.
It is a Chen prime.
It is equal to p3907703 and since 66207431 and 3907703 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 = 66207394 and 66207403.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (66207439) 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, 33103715 + 33103716.
It is an arithmetic number, because the mean of its divisors is an integer number (33103716).
Almost surely, 266207431 is an apocalyptic number.
66207431 is a deficient number, since it is larger than the sum of its proper divisors (1).
66207431 is an equidigital number, since it uses as much as digits as its factorization.
66207431 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6048, while the sum is 29.
The square root of 66207431 is about 8136.7948849655. The cubic root of 66207431 is about 404.5469322552.
Adding to 66207431 its reverse (13470266), we get a palindrome (79677697).
The spelling of 66207431 in words is "sixty-six million, two hundred seven thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •