Base | Representation |
---|---|
bin | 111100000110000100… |
… | …111010101001100000 |
3 | 20011112221220212122210 |
4 | 330012010322221200 |
5 | 2024122233232121 |
6 | 45350522002120 |
7 | 4443011605365 |
oct | 740604725140 |
9 | 204487825583 |
10 | 64526461536 |
11 | 25402561669 |
12 | 10609946340 |
13 | 611446a1b4 |
14 | 31a1aca46c |
15 | 1a29d1b876 |
hex | f0613aa60 |
64526461536 has 96 divisors (see below), whose sum is σ = 180061273728. Its totient is φ = 20162816000.
The previous prime is 64526461511. The next prime is 64526461537. The reversal of 64526461536 is 63516462546.
It is a tau number, because it is divible by the number of its divisors (96).
It is a Harshad number since it is a multiple of its sum of digits (48).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (64526461537) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 330871 + ... + 488393.
It is an arithmetic number, because the mean of its divisors is an integer number (1875638268).
Almost surely, 264526461536 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 64526461536, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (90030636864).
64526461536 is an abundant number, since it is smaller than the sum of its proper divisors (115534812192).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
64526461536 is a wasteful number, since it uses less digits than its factorization.
64526461536 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 157804 (or 157796 counting only the distinct ones).
The product of its digits is 3110400, while the sum is 48.
The spelling of 64526461536 in words is "sixty-four billion, five hundred twenty-six million, four hundred sixty-one thousand, five hundred thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •