Base | Representation |
---|---|
bin | 111100001000010101… |
… | …101010110110010101 |
3 | 20011122121022202000022 |
4 | 330020111222312111 |
5 | 2024211442021301 |
6 | 45354355154525 |
7 | 4443652260533 |
oct | 741025526625 |
9 | 204577282008 |
10 | 64564407701 |
11 | 25421a1a132 |
12 | 1061a5a5a45 |
13 | 611c294c51 |
14 | 31a6b67153 |
15 | 1a2d314d1b |
hex | f0856ad95 |
64564407701 has 4 divisors (see below), whose sum is σ = 65072788992. Its totient is φ = 64056026412.
The previous prime is 64564407673. The next prime is 64564407707. The reversal of 64564407701 is 10770446546.
64564407701 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 a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 10770446546 = 2 ⋅5385223273.
It is a cyclic number.
It is not a de Polignac number, because 64564407701 - 222 = 64560213397 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (64564407707) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 254190455 + ... + 254190708.
It is an arithmetic number, because the mean of its divisors is an integer number (16268197248).
Almost surely, 264564407701 is an apocalyptic number.
It is an amenable number.
64564407701 is a deficient number, since it is larger than the sum of its proper divisors (508381291).
64564407701 is a wasteful number, since it uses less digits than its factorization.
64564407701 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 508381290.
The product of its (nonzero) digits is 564480, while the sum is 44.
The spelling of 64564407701 in words is "sixty-four billion, five hundred sixty-four million, four hundred seven thousand, seven hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •