Base | Representation |
---|---|
bin | 1111010000110… |
… | …0001011100011 |
3 | 11110110012100212 |
4 | 3310030023203 |
5 | 112341404102 |
6 | 10204004335 |
7 | 1405046621 |
oct | 364141343 |
9 | 143405325 |
10 | 64013027 |
11 | 33151a31 |
12 | 195306ab |
13 | 10353740 |
14 | 8704511 |
15 | 5946c52 |
hex | 3d0c2e3 |
64013027 has 4 divisors (see below), whose sum is σ = 68937120. Its totient is φ = 59088936.
The previous prime is 64013023. The next prime is 64013039. The reversal of 64013027 is 72031046.
64013027 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 72031046 = 2 ⋅36015523.
It is a cyclic number.
It is not a de Polignac number, because 64013027 - 22 = 64013023 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 64012993 and 64013011.
It is not an unprimeable number, because it can be changed into a prime (64013021) 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 3 ways as a sum of consecutive naturals, for example, 2462027 + ... + 2462052.
It is an arithmetic number, because the mean of its divisors is an integer number (17234280).
Almost surely, 264013027 is an apocalyptic number.
64013027 is a deficient number, since it is larger than the sum of its proper divisors (4924093).
64013027 is a wasteful number, since it uses less digits than its factorization.
64013027 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4924092.
The product of its (nonzero) digits is 1008, while the sum is 23.
The square root of 64013027 is about 8000.8141460729. The cubic root of 64013027 is about 400.0271377421.
The spelling of 64013027 in words is "sixty-four million, thirteen thousand, twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •