Base | Representation |
---|---|
bin | 1111110100011… |
… | …1000101000111 |
3 | 11121212000001102 |
4 | 3331013011013 |
5 | 113441221211 |
6 | 10330050315 |
7 | 1433656256 |
oct | 375070507 |
9 | 147760042 |
10 | 66351431 |
11 | 344a98a3 |
12 | 1a27999b |
13 | 10991c03 |
14 | 8b5279d |
15 | 5c59a3b |
hex | 3f47147 |
66351431 has 2 divisors, whose sum is σ = 66351432. Its totient is φ = 66351430.
The previous prime is 66351413. The next prime is 66351433. The reversal of 66351431 is 13415366.
It is a happy number.
Together with previous prime (66351413) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 66351431 - 26 = 66351367 is a prime.
It is a super-2 number, since 2×663514312 = 8805024791495522, which contains 22 as substring.
Together with 66351433, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 66351394 and 66351403.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (66351433) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 33175715 + 33175716.
It is an arithmetic number, because the mean of its divisors is an integer number (33175716).
Almost surely, 266351431 is an apocalyptic number.
66351431 is a deficient number, since it is larger than the sum of its proper divisors (1).
66351431 is an equidigital number, since it uses as much as digits as its factorization.
66351431 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 6480, while the sum is 29.
The square root of 66351431 is about 8145.6387717600. The cubic root of 66351431 is about 404.8400140335.
Adding to 66351431 its reverse (13415366), we get a palindrome (79766797).
The spelling of 66351431 in words is "sixty-six million, three hundred fifty-one thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •