Base | Representation |
---|---|
bin | 100110101111100001010… |
… | …0100011000011111000000 |
3 | 200212001001111122012120010 |
4 | 1031133002210120133000 |
5 | 1144220021033001440 |
6 | 15154051401344520 |
7 | 1056461512665105 |
oct | 115370244303700 |
9 | 20761044565503 |
10 | 5324728797120 |
11 | 1773228655077 |
12 | 71bb74a98140 |
13 | 2c81731a1bb5 |
14 | 145a0ac36aac |
15 | 93795d81580 |
hex | 4d7c29187c0 |
5324728797120 has 224 divisors, whose sum is σ = 17025162393600. Its totient is φ = 1409926901760.
The previous prime is 5324728797053. The next prime is 5324728797161. The reversal of 5324728797120 is 217978274235.
It is a Smith number, since the sum of its digits (57) coincides with the sum of the digits of its prime factors.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 718486215 + ... + 718493625.
Almost surely, 25324728797120 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 5324728797120, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (8512581196800).
5324728797120 is an abundant number, since it is smaller than the sum of its proper divisors (11700433596480).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5324728797120 is a wasteful number, since it uses less digits than its factorization.
5324728797120 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12603 (or 12593 counting only the distinct ones).
The product of its (nonzero) digits is 11854080, while the sum is 57.
The spelling of 5324728797120 in words is "five trillion, three hundred twenty-four billion, seven hundred twenty-eight million, seven hundred ninety-seven thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •