Base | Representation |
---|---|
bin | 111011101101100011… |
… | …010110100101111011 |
3 | 20010111021200222010212 |
4 | 323231203112211323 |
5 | 2022301420304130 |
6 | 45242023101335 |
7 | 4426554410105 |
oct | 735543264573 |
9 | 203437628125 |
10 | 64115009915 |
11 | 25211284a00 |
12 | 10513ba184b |
13 | 607a1493b8 |
14 | 31631c4575 |
15 | 1a03b44e95 |
hex | eed8d697b |
64115009915 has 12 divisors (see below), whose sum is σ = 84568228752. Its totient is φ = 46629097680.
The previous prime is 64115009899. The next prime is 64115009923. The reversal of 64115009915 is 51990051146.
It is not a de Polignac number, because 64115009915 - 24 = 64115009899 is a prime.
It is a super-2 number, since 2×641150099152 (a number of 22 digits) contains 22 as substring.
It is a hoax number, since the sum of its digits (41) coincides with the sum of the digits of its distinct prime factors.
It is a Duffinian number.
It is an unprimeable number.
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 11 ways as a sum of consecutive naturals, for example, 52987007 + ... + 52988216.
It is an arithmetic number, because the mean of its divisors is an integer number (7047352396).
Almost surely, 264115009915 is an apocalyptic number.
64115009915 is a deficient number, since it is larger than the sum of its proper divisors (20453218837).
64115009915 is a wasteful number, since it uses less digits than its factorization.
64115009915 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 105975250 (or 105975239 counting only the distinct ones).
The product of its (nonzero) digits is 48600, while the sum is 41.
The spelling of 64115009915 in words is "sixty-four billion, one hundred fifteen million, nine thousand, nine hundred fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.114 sec. • engine limits •