Base | Representation |
---|---|
bin | 1111010001100… |
… | …0000000101101 |
3 | 11110112122211121 |
4 | 3310120000231 |
5 | 112344431420 |
6 | 10205020541 |
7 | 1405341115 |
oct | 364300055 |
9 | 143478747 |
10 | 64061485 |
11 | 33185384 |
12 | 19554751 |
13 | 1036c807 |
14 | 8718045 |
15 | 59562aa |
hex | 3d1802d |
64061485 has 4 divisors (see below), whose sum is σ = 76873788. Its totient is φ = 51249184.
The previous prime is 64061479. The next prime is 64061519. The reversal of 64061485 is 58416046.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 37785609 + 26275876 = 6147^2 + 5126^2 .
It is a cyclic number.
It is not a de Polignac number, because 64061485 - 23 = 64061477 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 64061485.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 6406144 + ... + 6406153.
It is an arithmetic number, because the mean of its divisors is an integer number (19218447).
Almost surely, 264061485 is an apocalyptic number.
It is an amenable number.
64061485 is a deficient number, since it is larger than the sum of its proper divisors (12812303).
64061485 is a wasteful number, since it uses less digits than its factorization.
64061485 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12812302.
The product of its (nonzero) digits is 23040, while the sum is 34.
The square root of 64061485 is about 8003.8418899926. The cubic root of 64061485 is about 400.1280527519.
It can be divided in two parts, 64061 and 485, that added together give a palindrome (64546).
The spelling of 64061485 in words is "sixty-four million, sixty-one thousand, four hundred eighty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •