Base | Representation |
---|---|
bin | 1111010010111… |
… | …1110100100101 |
3 | 11110201121121202 |
4 | 3310233310211 |
5 | 112411042023 |
6 | 10211052245 |
7 | 1406225342 |
oct | 364576445 |
9 | 143647552 |
10 | 64159013 |
11 | 33241686 |
12 | 195a1085 |
13 | 103a5019 |
14 | 87417c9 |
15 | 5975128 |
hex | 3d2fd25 |
64159013 has 2 divisors, whose sum is σ = 64159014. Its totient is φ = 64159012.
The previous prime is 64158961. The next prime is 64159031. The reversal of 64159013 is 31095146.
Together with next prime (64159031) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 44649124 + 19509889 = 6682^2 + 4417^2 .
It is a cyclic number.
It is not a de Polignac number, because 64159013 - 26 = 64158949 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (64159033) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 32079506 + 32079507.
It is an arithmetic number, because the mean of its divisors is an integer number (32079507).
Almost surely, 264159013 is an apocalyptic number.
It is an amenable number.
64159013 is a deficient number, since it is larger than the sum of its proper divisors (1).
64159013 is an equidigital number, since it uses as much as digits as its factorization.
64159013 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 3240, while the sum is 29.
The square root of 64159013 is about 8009.9321470285. The cubic root of 64159013 is about 400.3310031001.
The spelling of 64159013 in words is "sixty-four million, one hundred fifty-nine thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •