Base | Representation |
---|---|
bin | 110100010111100110… |
… | …000110100101110000 |
3 | 12101010210111021120020 |
4 | 310113212012211300 |
5 | 1410124443024110 |
6 | 41455405243440 |
7 | 4030304563521 |
oct | 642746064560 |
9 | 171123437506 |
10 | 56230439280 |
11 | 21935687324 |
12 | aa93563580 |
13 | 53c17bc9a2 |
14 | 2a15da6848 |
15 | 16e184ad70 |
hex | d17986970 |
56230439280 has 160 divisors (see below), whose sum is σ = 177763289088. Its totient is φ = 14699750400.
The previous prime is 56230439273. The next prime is 56230439299. The reversal of 56230439280 is 8293403265.
It is a super-3 number, since 3×562304392803 (a number of 33 digits) contains 333 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 31 ways as a sum of consecutive naturals, for example, 4488225 + ... + 4500735.
Almost surely, 256230439280 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 56230439280, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (88881644544).
56230439280 is an abundant number, since it is smaller than the sum of its proper divisors (121532849808).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
56230439280 is a wasteful number, since it uses less digits than its factorization.
56230439280 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12895 (or 12889 counting only the distinct ones).
The product of its (nonzero) digits is 311040, while the sum is 42.
It can be divided in two parts, 56230 and 439280, that added together give a triangular number (495510 = T995).
The spelling of 56230439280 in words is "fifty-six billion, two hundred thirty million, four hundred thirty-nine thousand, two hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •