Base | Representation |
---|---|
bin | 11101010110110001001110… |
… | …00010101011000100110011 |
3 | 22110120022012012011112222211 |
4 | 32223120213002223010303 |
5 | 31430123104422033102 |
6 | 345143412051512551 |
7 | 16411605426644533 |
oct | 1653304702530463 |
9 | 273508165145884 |
10 | 64554013471027 |
11 | 19629226759423 |
12 | 72a70005b8757 |
13 | 2a03556bc1822 |
14 | 11d26066494c3 |
15 | 76e2e856c7d7 |
hex | 3ab6270ab133 |
64554013471027 has 4 divisors (see below), whose sum is σ = 64554081066216. Its totient is φ = 64553945875840.
The previous prime is 64554013471021. The next prime is 64554013471043. The reversal of 64554013471027 is 72017431045546.
64554013471027 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.
It is a cyclic number.
It is not a de Polignac number, because 64554013471027 - 239 = 64004257657139 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (64554013471021) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 32344249 + ... + 34282042.
It is an arithmetic number, because the mean of its divisors is an integer number (16138520266554).
Almost surely, 264554013471027 is an apocalyptic number.
64554013471027 is a deficient number, since it is larger than the sum of its proper divisors (67595189).
64554013471027 is an equidigital number, since it uses as much as digits as its factorization.
64554013471027 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 67595188.
The product of its (nonzero) digits is 2822400, while the sum is 49.
The spelling of 64554013471027 in words is "sixty-four trillion, five hundred fifty-four billion, thirteen million, four hundred seventy-one thousand, twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •