Base | Representation |
---|---|
bin | 111011110101111100… |
… | …010111111100000000 |
3 | 20010212002121011122210 |
4 | 323311330113330000 |
5 | 2023043440134002 |
6 | 45304012302120 |
7 | 4433214114153 |
oct | 736574277400 |
9 | 203762534583 |
10 | 64255786752 |
11 | 252837976a3 |
12 | 10553171940 |
13 | 60a03691c1 |
14 | 3177b8bc9a |
15 | 1a111a196c |
hex | ef5f17f00 |
64255786752 has 72 divisors (see below), whose sum is σ = 171112233600. Its totient is φ = 21406305280.
The previous prime is 64255786687. The next prime is 64255786769. The reversal of 64255786752 is 25768755246.
It is a super-2 number, since 2×642557867522 (a number of 22 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 64255786692 and 64255786701.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1367749 + ... + 1413947.
It is an arithmetic number, because the mean of its divisors is an integer number (2376558800).
Almost surely, 264255786752 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 64255786752, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (85556116800).
64255786752 is an abundant number, since it is smaller than the sum of its proper divisors (106856446848).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
64255786752 is a wasteful number, since it uses less digits than its factorization.
64255786752 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 48029 (or 48015 counting only the distinct ones).
The product of its digits is 28224000, while the sum is 57.
The spelling of 64255786752 in words is "sixty-four billion, two hundred fifty-five million, seven hundred eighty-six thousand, seven hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •