Base | Representation |
---|---|
bin | 11101011111100000011011… |
… | …10101000111101000010000 |
3 | 22111122000010100221220120211 |
4 | 32233300031311013220100 |
5 | 32000032434434321123 |
6 | 345533343053413504 |
7 | 16442364324012550 |
oct | 1657601565075020 |
9 | 274560110856524 |
10 | 64854238198288 |
11 | 19734589797630 |
12 | 733522919a294 |
13 | 2a25961454736 |
14 | 1202d67569160 |
15 | 77701a81c40d |
hex | 3afc0dd47a10 |
64854238198288 has 80 divisors (see below), whose sum is σ = 156758988818304. Its totient is φ = 25252062151680.
The previous prime is 64854238198199. The next prime is 64854238198289. The reversal of 64854238198288 is 88289183245846.
64854238198288 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×648542381982882 (a number of 28 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (64854238198289) 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 15 ways as a sum of consecutive naturals, for example, 14513845 + ... + 18448852.
Almost surely, 264854238198288 is an apocalyptic number.
It is an amenable number.
64854238198288 is an abundant number, since it is smaller than the sum of its proper divisors (91904750620016).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
64854238198288 is a wasteful number, since it uses less digits than its factorization.
64854238198288 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 32964320 (or 32964314 counting only the distinct ones).
The product of its digits is 1698693120, while the sum is 76.
The spelling of 64854238198288 in words is "sixty-four trillion, eight hundred fifty-four billion, two hundred thirty-eight million, one hundred ninety-eight thousand, two hundred eighty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •