Base | Representation |
---|---|
bin | 1111010001101… |
… | …0100101000101 |
3 | 11110120012021020 |
4 | 3310122211011 |
5 | 112400301010 |
6 | 10205141353 |
7 | 1405413564 |
oct | 364324505 |
9 | 143505236 |
10 | 64072005 |
11 | 33192278 |
12 | 1955a859 |
13 | 1037453a |
14 | 871bbdb |
15 | 5959470 |
hex | 3d1a945 |
64072005 has 8 divisors (see below), whose sum is σ = 102515232. Its totient is φ = 34171728.
The previous prime is 64072003. The next prime is 64072007. The reversal of 64072005 is 50027046.
It is a happy number.
64072005 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an interprime number because it is at equal distance from previous prime (64072003) and next prime (64072007).
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 64072005 - 21 = 64072003 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (64072003) by changing a digit.
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, 2135719 + ... + 2135748.
It is an arithmetic number, because the mean of its divisors is an integer number (12814404).
Almost surely, 264072005 is an apocalyptic number.
It is an amenable number.
64072005 is a deficient number, since it is larger than the sum of its proper divisors (38443227).
64072005 is a wasteful number, since it uses less digits than its factorization.
64072005 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4271475.
The product of its (nonzero) digits is 1680, while the sum is 24.
The square root of 64072005 is about 8004.4990474108. The cubic root of 64072005 is about 400.1499541940.
The spelling of 64072005 in words is "sixty-four million, seventy-two thousand, five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •