Base | Representation |
---|---|
bin | 110100001100100010… |
… | …011011010000110000 |
3 | 12100122212102020012000 |
4 | 310030202123100300 |
5 | 1404240000113000 |
6 | 41425141134000 |
7 | 4022563003500 |
oct | 641442332060 |
9 | 170585366160 |
10 | 56044926000 |
11 | 2184a999468 |
12 | aa413ba300 |
13 | 539223850b |
14 | 29d94b5a00 |
15 | 16d0404000 |
hex | d0c89b430 |
56044926000 has 960 divisors, whose sum is σ = 238163328000. Its totient is φ = 12558067200.
The previous prime is 56044925971. The next prime is 56044926013. The reversal of 56044926000 is 62944065.
56044926000 is a `hidden beast` number, since 5 + 6 + 0 + 4 + 49 + 2 + 600 + 0 = 666.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 191 ways as a sum of consecutive naturals, for example, 156113821 + ... + 156114179.
It is an arithmetic number, because the mean of its divisors is an integer number (248086800).
Almost surely, 256044926000 is an apocalyptic number.
56044926000 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 56044926000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (119081664000).
56044926000 is an abundant number, since it is smaller than the sum of its proper divisors (182118402000).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
56044926000 is a wasteful number, since it uses less digits than its factorization.
56044926000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 464 (or 435 counting only the distinct ones).
The product of its (nonzero) digits is 51840, while the sum is 36.
The spelling of 56044926000 in words is "fifty-six billion, forty-four million, nine hundred twenty-six thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •