Base | Representation |
---|---|
bin | 1111110010110… |
… | …1101101011001 |
3 | 11121122201111121 |
4 | 3330231231121 |
5 | 113424410023 |
6 | 10323525241 |
7 | 1433044303 |
oct | 374555531 |
9 | 147581447 |
10 | 66247513 |
11 | 34438812 |
12 | 1a229821 |
13 | 10956817 |
14 | 8b26973 |
15 | 5c38d5d |
hex | 3f2db59 |
66247513 has 8 divisors (see below), whose sum is σ = 70204680. Its totient is φ = 62401920.
The previous prime is 66247483. The next prime is 66247543. The reversal of 66247513 is 31574266.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (66247483) and next prime (66247543).
It can be written as a sum of positive squares in 4 ways, for example, as 9290304 + 56957209 = 3048^2 + 7547^2 .
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 66247513 - 225 = 32693081 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (66247543) 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, 26670 + ... + 29047.
It is an arithmetic number, because the mean of its divisors is an integer number (8775585).
Almost surely, 266247513 is an apocalyptic number.
It is an amenable number.
66247513 is a deficient number, since it is larger than the sum of its proper divisors (3957167).
66247513 is a wasteful number, since it uses less digits than its factorization.
66247513 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 55787.
The product of its digits is 30240, while the sum is 34.
The square root of 66247513 is about 8139.2575214205. The cubic root of 66247513 is about 404.6285534005.
The spelling of 66247513 in words is "sixty-six million, two hundred forty-seven thousand, five hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •