Base | Representation |
---|---|
bin | 101000011101010001100… |
… | …1001011010100000000000 |
3 | 201200120102120022111120020 |
4 | 1100322203021122200000 |
5 | 1212100222224210242 |
6 | 15454231321413440 |
7 | 1112504340155442 |
oct | 120724311324000 |
9 | 21616376274506 |
10 | 5560424835072 |
11 | 185418794a988 |
12 | 75979303a280 |
13 | 314465997903 |
14 | 1531a9a4a492 |
15 | 9998d0246ec |
hex | 50ea325a800 |
5560424835072 has 192 divisors, whose sum is σ = 15615407808000. Its totient is φ = 1754684964864.
The previous prime is 5560424835071. The next prime is 5560424835079. The reversal of 5560424835072 is 2705384240655.
It is a tau number, because it is divible by the number of its divisors (192).
It is not an unprimeable number, because it can be changed into a prime (5560424835071) 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, 173103429 + ... + 173135547.
It is an arithmetic number, because the mean of its divisors is an integer number (81330249000).
Almost surely, 25560424835072 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 5560424835072, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (7807703904000).
5560424835072 is an abundant number, since it is smaller than the sum of its proper divisors (10054982972928).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5560424835072 is a wasteful number, since it uses less digits than its factorization.
5560424835072 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 33646 (or 33626 counting only the distinct ones).
The product of its (nonzero) digits is 8064000, while the sum is 51.
The spelling of 5560424835072 in words is "five trillion, five hundred sixty billion, four hundred twenty-four million, eight hundred thirty-five thousand, seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •