Base | Representation |
---|---|
bin | 110100011010110001… |
… | …101011011010100000 |
3 | 12101021111220120001010 |
4 | 310122301223122200 |
5 | 1410232123232334 |
6 | 41504553140520 |
7 | 4031523310644 |
oct | 643261533240 |
9 | 171244816033 |
10 | 56283805344 |
11 | 21962817008 |
12 | aaa93ba740 |
13 | 53cc886240 |
14 | 2a1d0d8c24 |
15 | 16e638d0e9 |
hex | d1ac6b6a0 |
56283805344 has 192 divisors, whose sum is σ = 164690426880. Its totient is φ = 16713768960.
The previous prime is 56283805321. The next prime is 56283805387. The reversal of 56283805344 is 44350838265.
It is a Harshad number since it is a multiple of its sum of digits (48).
It is a junction number, because it is equal to n+sod(n) for n = 56283805293 and 56283805302.
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, 15821614 + ... + 15825170.
It is an arithmetic number, because the mean of its divisors is an integer number (857762640).
Almost surely, 256283805344 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 56283805344, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (82345213440).
56283805344 is an abundant number, since it is smaller than the sum of its proper divisors (108406621536).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
56283805344 is a wasteful number, since it uses less digits than its factorization.
56283805344 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4023 (or 4015 counting only the distinct ones).
The product of its (nonzero) digits is 2764800, while the sum is 48.
The spelling of 56283805344 in words is "fifty-six billion, two hundred eighty-three million, eight hundred five thousand, three hundred forty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •