Base | Representation |
---|---|
bin | 111100001111000011… |
… | …101100100001101001 |
3 | 20011221110102221211121 |
4 | 330033003230201221 |
5 | 2024424321331424 |
6 | 45413503255241 |
7 | 4446521406100 |
oct | 741703544151 |
9 | 204843387747 |
10 | 64677136489 |
11 | 2547a614a19 |
12 | 106502aa521 |
13 | 6139744384 |
14 | 31b7b0d037 |
15 | 1a38180ee4 |
hex | f0f0ec869 |
64677136489 has 27 divisors (see below), whose sum is σ = 76971082647. Its totient is φ = 54187831824.
The previous prime is 64677136481. The next prime is 64677136493. The reversal of 64677136489 is 98463177646.
The square root of 64677136489 is 254317.
It is a perfect power (a square), and thus also a powerful number.
64677136489 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in only one way, i.e., 4115864025 + 60561272464 = 64155^2 + 246092^2 .
It is not a de Polignac number, because 64677136489 - 23 = 64677136481 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (64677136481) by changing a digit.
It is a polite number, since it can be written in 26 ways as a sum of consecutive naturals, for example, 83669907 + ... + 83670679.
Almost surely, 264677136489 is an apocalyptic number.
64677136489 is the 254317-th square number.
64677136489 is the 127159-th centered octagonal number.
It is an amenable number.
64677136489 is a deficient number, since it is larger than the sum of its proper divisors (12293946158).
64677136489 is an frugal number, since it uses more digits than its factorization.
64677136489 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1654 (or 827 counting only the distinct ones).
The product of its digits is 36578304, while the sum is 61.
The spelling of 64677136489 in words is "sixty-four billion, six hundred seventy-seven million, one hundred thirty-six thousand, four hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •