Base | Representation |
---|---|
bin | 1111010110101… |
… | …0110011011101 |
3 | 11111011220000121 |
4 | 3311222303131 |
5 | 112441304410 |
6 | 10220154541 |
7 | 1411252603 |
oct | 365526335 |
9 | 144156017 |
10 | 64400605 |
11 | 33397145 |
12 | 19698a51 |
13 | 1045ac89 |
14 | 87a5873 |
15 | 59c19da |
hex | 3d6acdd |
64400605 has 4 divisors (see below), whose sum is σ = 77280732. Its totient is φ = 51520480.
The previous prime is 64400603. The next prime is 64400617. The reversal of 64400605 is 50600446.
It is a happy number.
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 16818201 + 47582404 = 4101^2 + 6898^2 .
It is not a de Polignac number, because 64400605 - 21 = 64400603 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 64400605.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (64400603) 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 3 ways as a sum of consecutive naturals, for example, 6440056 + ... + 6440065.
It is an arithmetic number, because the mean of its divisors is an integer number (19320183).
Almost surely, 264400605 is an apocalyptic number.
It is an amenable number.
64400605 is a deficient number, since it is larger than the sum of its proper divisors (12880127).
64400605 is a wasteful number, since it uses less digits than its factorization.
64400605 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12880126.
The product of its (nonzero) digits is 2880, while the sum is 25.
The square root of 64400605 is about 8024.9987538940. The cubic root of 64400605 is about 400.8328584136.
The spelling of 64400605 in words is "sixty-four million, four hundred thousand, six hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •