Base | Representation |
---|---|
bin | 101000100110101001011… |
… | …1010001101001111111100 |
3 | 201202111101100222000122220 |
4 | 1101031102322031033330 |
5 | 1212412433144222321 |
6 | 15511400525005340 |
7 | 1114116214104546 |
oct | 121152272151774 |
9 | 21674340860586 |
10 | 5580553507836 |
11 | 1861776a7472a |
12 | 7616700b3850 |
13 | 316322c14b78 |
14 | 154159068696 |
15 | 9a26a20a9c6 |
hex | 51352e8d3fc |
5580553507836 has 48 divisors (see below), whose sum is σ = 13388691808800. Its totient is φ = 1808342744832.
The previous prime is 5580553507829. The next prime is 5580553507873. The reversal of 5580553507836 is 6387053550855.
It is a happy number.
It is a super-2 number, since 2×55805535078362 (a number of 26 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 5580553507836.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 40180471 + ... + 40319118.
It is an arithmetic number, because the mean of its divisors is an integer number (278931079350).
Almost surely, 25580553507836 is an apocalyptic number.
It is an amenable number.
5580553507836 is an abundant number, since it is smaller than the sum of its proper divisors (7808138300964).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5580553507836 is a wasteful number, since it uses less digits than its factorization.
5580553507836 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 80499758 (or 80499756 counting only the distinct ones).
The product of its (nonzero) digits is 75600000, while the sum is 60.
The spelling of 5580553507836 in words is "five trillion, five hundred eighty billion, five hundred fifty-three million, five hundred seven thousand, eight hundred thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •