Base | Representation |
---|---|
bin | 11001101100110101100010… |
… | …00100000001000101111110 |
3 | 21102002220001200112211100220 |
4 | 30312122301010001011332 |
5 | 24401430033434113204 |
6 | 320111054440402210 |
7 | 14622104614204533 |
oct | 1466326104010576 |
9 | 242086050484326 |
10 | 56516150301054 |
11 | 1700a401521184 |
12 | 6409260476366 |
13 | 256c5b0b5c9a2 |
14 | dd5579514d8a |
15 | 6801ac5101d9 |
hex | 3366b110117e |
56516150301054 has 16 divisors (see below), whose sum is σ = 113203302577680. Its totient is φ = 18810216437760.
The previous prime is 56516150301043. The next prime is 56516150301071. The reversal of 56516150301054 is 45010305161565.
It is a super-2 number, since 2×565161503010542 (a number of 28 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 56516150300997 and 56516150301015.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 7125078019 + ... + 7125085950.
It is an arithmetic number, because the mean of its divisors is an integer number (7075206411105).
Almost surely, 256516150301054 is an apocalyptic number.
56516150301054 is an abundant number, since it is smaller than the sum of its proper divisors (56687152276626).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
56516150301054 is a wasteful number, since it uses less digits than its factorization.
56516150301054 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14250164635.
The product of its (nonzero) digits is 270000, while the sum is 42.
The spelling of 56516150301054 in words is "fifty-six trillion, five hundred sixteen billion, one hundred fifty million, three hundred one thousand, fifty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •