Base | Representation |
---|---|
bin | 1111110110100… |
… | …0100010010001 |
3 | 11122002222000202 |
4 | 3331220202101 |
5 | 114010112330 |
6 | 10333024545 |
7 | 1435066631 |
oct | 375504221 |
9 | 148088022 |
10 | 66488465 |
11 | 3459284a |
12 | 1a325155 |
13 | 10a0c3b4 |
14 | 8b8a6c1 |
15 | 5c85445 |
hex | 3f68891 |
66488465 has 8 divisors (see below), whose sum is σ = 79829928. Its totient is φ = 53161600.
The previous prime is 66488453. The next prime is 66488489. The reversal of 66488465 is 56488466.
It is a happy number.
66488465 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 4 ways, for example, as 2119936 + 64368529 = 1456^2 + 8023^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 66488465 - 220 = 65439889 is a prime.
It is a Duffinian number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 16115 + ... + 19815.
It is an arithmetic number, because the mean of its divisors is an integer number (9978741).
Almost surely, 266488465 is an apocalyptic number.
It is an amenable number.
66488465 is a deficient number, since it is larger than the sum of its proper divisors (13341463).
66488465 is a wasteful number, since it uses less digits than its factorization.
66488465 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7299.
The product of its digits is 1105920, while the sum is 47.
The square root of 66488465 is about 8154.0459282494. The cubic root of 66488465 is about 405.1185244728.
Subtracting from 66488465 its reverse (56488466), we obtain a palindrome (9999999).
The spelling of 66488465 in words is "sixty-six million, four hundred eighty-eight thousand, four hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •