Base | Representation |
---|---|
bin | 101101011000111100… |
… | …1111010000000101000 |
3 | 100022121010120122110220 |
4 | 1122301321322000220 |
5 | 3044111322340220 |
6 | 112440130410040 |
7 | 10020332364240 |
oct | 1326171720050 |
9 | 308533518426 |
10 | 97474027560 |
11 | 3837a602678 |
12 | 16a83a30920 |
13 | 92653b85b0 |
14 | 4a097acb20 |
15 | 28075cd540 |
hex | 16b1e7a028 |
97474027560 has 512 divisors, whose sum is σ = 369963417600. Its totient is φ = 19997061120.
The previous prime is 97474027537. The next prime is 97474027571. The reversal of 97474027560 is 6572047479.
97474027560 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 91869430 + ... + 91870490.
It is an arithmetic number, because the mean of its divisors is an integer number (722584800).
Almost surely, 297474027560 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 97474027560, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (184981708800).
97474027560 is an abundant number, since it is smaller than the sum of its proper divisors (272489390040).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
97474027560 is a wasteful number, since it uses less digits than its factorization.
97474027560 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1321 (or 1317 counting only the distinct ones).
The product of its (nonzero) digits is 2963520, while the sum is 51.
The spelling of 97474027560 in words is "ninety-seven billion, four hundred seventy-four million, twenty-seven thousand, five hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •