Base | Representation |
---|---|
bin | 101000110100001000110… |
… | …1011101001010111100000 |
3 | 201212021011100221121102121 |
4 | 1101220101223221113200 |
5 | 1213401301112133010 |
6 | 15532551341554024 |
7 | 1116163142535364 |
oct | 121502153512740 |
9 | 21767140847377 |
10 | 5609523942880 |
11 | 1872a93031330 |
12 | 7671b6275914 |
13 | 318c8bbbab20 |
14 | 15570686b2a4 |
15 | 9adb37633da |
hex | 51a11ae95e0 |
5609523942880 has 384 divisors, whose sum is σ = 16605704142720. Its totient is φ = 1759205130240.
The previous prime is 5609523942859. The next prime is 5609523942907. The reversal of 5609523942880 is 882493259065.
It is a happy number.
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 63 ways as a sum of consecutive naturals, for example, 53234886 + ... + 53340154.
It is an arithmetic number, because the mean of its divisors is an integer number (43244021205).
Almost surely, 25609523942880 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 5609523942880, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (8302852071360).
5609523942880 is an abundant number, since it is smaller than the sum of its proper divisors (10996180199840).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5609523942880 is a wasteful number, since it uses less digits than its factorization.
5609523942880 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 105462 (or 105454 counting only the distinct ones).
The product of its (nonzero) digits is 37324800, while the sum is 61.
The spelling of 5609523942880 in words is "five trillion, six hundred nine billion, five hundred twenty-three million, nine hundred forty-two thousand, eight hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •