Base | Representation |
---|---|
bin | 1111110000110… |
… | …0111001111011 |
3 | 11121101220012002 |
4 | 3330030321323 |
5 | 113411110042 |
6 | 10321011215 |
7 | 1431644462 |
oct | 374147173 |
9 | 147356162 |
10 | 66113147 |
11 | 34356871 |
12 | 1a183b0b |
13 | 1090a609 |
14 | 8acd9d9 |
15 | 5c0e132 |
hex | 3f0ce7b |
66113147 has 2 divisors, whose sum is σ = 66113148. Its totient is φ = 66113146.
The previous prime is 66113143. The next prime is 66113189. The reversal of 66113147 is 74131166.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 66113147 - 22 = 66113143 is a prime.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (66113143) 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, 33056573 + 33056574.
It is an arithmetic number, because the mean of its divisors is an integer number (33056574).
Almost surely, 266113147 is an apocalyptic number.
66113147 is a deficient number, since it is larger than the sum of its proper divisors (1).
66113147 is an equidigital number, since it uses as much as digits as its factorization.
66113147 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 3024, while the sum is 29.
The square root of 66113147 is about 8130.9991390972. Note that the first 3 decimals coincide. The cubic root of 66113147 is about 404.3548066761.
The spelling of 66113147 in words is "sixty-six million, one hundred thirteen thousand, one hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •