Base | Representation |
---|---|
bin | 11001110101000110011000… |
… | …00010100101110000000000 |
3 | 21110010000220120222012021120 |
4 | 30322203030002211300000 |
5 | 24421103021103101110 |
6 | 320445331533152240 |
7 | 14651445463216161 |
oct | 1472431402456000 |
9 | 243100816865246 |
10 | 56800070753280 |
11 | 17109858190218 |
12 | 645429892b680 |
13 | 25902ba5a2a8a |
14 | 10051d0cd9768 |
15 | 687778213870 |
hex | 33a8cc0a5c00 |
56800070753280 has 528 divisors, whose sum is σ = 188148971215872. Its totient is φ = 14624663961600.
The previous prime is 56800070753213. The next prime is 56800070753297. The reversal of 56800070753280 is 8235707000865.
It is a super-2 number, since 2×568000707532802 (a number of 28 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 6834320325 + ... + 6834328635.
Almost surely, 256800070753280 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 56800070753280, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (94074485607936).
56800070753280 is an abundant number, since it is smaller than the sum of its proper divisors (131348900462592).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
56800070753280 is a wasteful number, since it uses less digits than its factorization.
56800070753280 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8864 (or 8815 counting only the distinct ones).
The product of its (nonzero) digits is 2822400, while the sum is 51.
The spelling of 56800070753280 in words is "fifty-six trillion, eight hundred billion, seventy million, seven hundred fifty-three thousand, two hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •