Base | Representation |
---|---|
bin | 1111110101101… |
… | …1010100011011 |
3 | 11122000012202210 |
4 | 3331123110123 |
5 | 114001344311 |
6 | 10331530203 |
7 | 1434453045 |
oct | 375332433 |
9 | 148005683 |
10 | 66434331 |
11 | 34556107 |
12 | 1a2b9963 |
13 | 109c0872 |
14 | 8b74a95 |
15 | 5c743a6 |
hex | 3f5b51b |
66434331 has 8 divisors (see below), whose sum is σ = 91633680. Its totient is φ = 42762272.
The previous prime is 66434321. The next prime is 66434341. The reversal of 66434331 is 13343466.
It is an interprime number because it is at equal distance from previous prime (66434321) and next prime (66434341).
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 66434331 - 210 = 66433307 is a prime.
It is a super-2 number, since 2×664343312 = 8827040670835122, which contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (66434321) 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 in 7 ways as a sum of consecutive naturals, for example, 381720 + ... + 381893.
It is an arithmetic number, because the mean of its divisors is an integer number (11454210).
Almost surely, 266434331 is an apocalyptic number.
66434331 is a deficient number, since it is larger than the sum of its proper divisors (25199349).
66434331 is a wasteful number, since it uses less digits than its factorization.
66434331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 763645.
The product of its digits is 15552, while the sum is 30.
The square root of 66434331 is about 8150.7257959031. The cubic root of 66434331 is about 405.0085472971.
Adding to 66434331 its reverse (13343466), we get a palindrome (79777797).
The spelling of 66434331 in words is "sixty-six million, four hundred thirty-four thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •