Base | Representation |
---|---|
bin | 11101010101001101001101… |
… | …11111100100011010100001 |
3 | 22110101011121120220101220002 |
4 | 32222212212333210122201 |
5 | 31423233131321103423 |
6 | 345103012425425345 |
7 | 16404665124201443 |
oct | 1652464677443241 |
9 | 273334546811802 |
10 | 64500325566113 |
11 | 19608486297878 |
12 | 729871863b255 |
13 | 29cb47c0a4558 |
14 | 11cdb92206493 |
15 | 76cc05050228 |
hex | 3aa9a6fe46a1 |
64500325566113 has 8 divisors (see below), whose sum is σ = 67240198868736. Its totient is φ = 61801653366000.
The previous prime is 64500325565959. The next prime is 64500325566121. The reversal of 64500325566113 is 31166552300546.
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 64500325566113 - 226 = 64500258457249 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (64500325566143) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 10300272431 + ... + 10300278692.
It is an arithmetic number, because the mean of its divisors is an integer number (8405024858592).
Almost surely, 264500325566113 is an apocalyptic number.
It is an amenable number.
64500325566113 is a deficient number, since it is larger than the sum of its proper divisors (2739873302623).
64500325566113 is a wasteful number, since it uses less digits than its factorization.
64500325566113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20600551255.
The product of its (nonzero) digits is 1944000, while the sum is 47.
Adding to 64500325566113 its reverse (31166552300546), we get a palindrome (95666877866659).
The spelling of 64500325566113 in words is "sixty-four trillion, five hundred billion, three hundred twenty-five million, five hundred sixty-six thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •