Base | Representation |
---|---|
bin | 111100000011010010… |
… | …000000110000000000 |
3 | 20011102200200011121210 |
4 | 330003102000300000 |
5 | 2024023232002002 |
6 | 45342124450120 |
7 | 4441602145263 |
oct | 740322006000 |
9 | 204380604553 |
10 | 64479562752 |
11 | 25389039940 |
12 | 105b60a9940 |
13 | 6107829537 |
14 | 319979ccda |
15 | 1a25b5596c |
hex | f03480c00 |
64479562752 has 352 divisors, whose sum is σ = 200560147200. Its totient is φ = 18200657920.
The previous prime is 64479562751. The next prime is 64479562789. The reversal of 64479562752 is 25726597446.
It is a tau number, because it is divible by the number of its divisors (352).
It is a super-2 number, since 2×644795627522 (a number of 22 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 64479562692 and 64479562701.
It is not an unprimeable number, because it can be changed into a prime (64479562751) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 61467124 + ... + 61468172.
Almost surely, 264479562752 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 64479562752, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (100280073600).
64479562752 is an abundant number, since it is smaller than the sum of its proper divisors (136080584448).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
64479562752 is a wasteful number, since it uses less digits than its factorization.
64479562752 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1207 (or 1189 counting only the distinct ones).
The product of its digits is 25401600, while the sum is 57.
The spelling of 64479562752 in words is "sixty-four billion, four hundred seventy-nine million, five hundred sixty-two thousand, seven hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •