Base | Representation |
---|---|
bin | 11101011001011101100101… |
… | …11110101111101001100101 |
3 | 22110220011001121102222222122 |
4 | 32230232302332233221211 |
5 | 31433132121211032040 |
6 | 345254115002035325 |
7 | 16421362624524665 |
oct | 1654566276575145 |
9 | 273804047388878 |
10 | 64646555564645 |
11 | 196644a531402a |
12 | 7300b287a8b45 |
13 | 2a0c1b45909c2 |
14 | 11d6ca4dd41a5 |
15 | 771912b8c1b5 |
hex | 3acbb2fafa65 |
64646555564645 has 8 divisors (see below), whose sum is σ = 79226417032704. Its totient is φ = 50616877548304.
The previous prime is 64646555564609. The next prime is 64646555564729. The reversal of 64646555564645 is 54646555564646.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 64646555564645 - 28 = 64646555564389 is a prime.
It is a Duffinian number.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 137545862669 + ... + 137545863138.
It is an arithmetic number, because the mean of its divisors is an integer number (9903302129088).
Almost surely, 264646555564645 is an apocalyptic number.
It is an amenable number.
64646555564645 is a deficient number, since it is larger than the sum of its proper divisors (14579861468059).
64646555564645 is a wasteful number, since it uses less digits than its factorization.
64646555564645 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 275091725859.
The product of its digits is 6220800000, while the sum is 71.
Subtracting from 64646555564645 its reverse (54646555564646), we obtain a palindrome (9999999999999).
The spelling of 64646555564645 in words is "sixty-four trillion, six hundred forty-six billion, five hundred fifty-five million, five hundred sixty-four thousand, six hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •