Base | Representation |
---|---|
bin | 110100011011101110… |
… | …110000010000000000 |
3 | 12101022122000222110000 |
4 | 310123232300100000 |
5 | 1410300223102221 |
6 | 41510324240000 |
7 | 4032106353030 |
oct | 643356602000 |
9 | 171278028400 |
10 | 56299815936 |
11 | 21970862001 |
12 | aab2840000 |
13 | 5402ca0870 |
14 | 2a212a58c0 |
15 | 16e79a1e26 |
hex | d1bbb0400 |
56299815936 has 440 divisors, whose sum is σ = 206947442240. Its totient is φ = 14846312448.
The previous prime is 56299815911. The next prime is 56299815937. The reversal of 56299815936 is 63951899265.
It is a Harshad number since it is a multiple of its sum of digits (63).
It is not an unprimeable number, because it can be changed into a prime (56299815937) by changing a digit.
It is a polite number, since it can be written in 39 ways as a sum of consecutive naturals, for example, 7544175 + ... + 7551633.
It is an arithmetic number, because the mean of its divisors is an integer number (470335096).
Almost surely, 256299815936 is an apocalyptic number.
56299815936 is a gapful number since it is divisible by the number (56) 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 56299815936, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (103473721120).
56299815936 is an abundant number, since it is smaller than the sum of its proper divisors (150647626304).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
56299815936 is a wasteful number, since it uses less digits than its factorization.
56299815936 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7511 (or 7484 counting only the distinct ones).
The product of its digits is 31492800, while the sum is 63.
The spelling of 56299815936 in words is "fifty-six billion, two hundred ninety-nine million, eight hundred fifteen thousand, nine hundred thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •