Base | Representation |
---|---|
bin | 1101011000001… |
… | …1000111110000 |
3 | 10220120202122102 |
4 | 3112003013300 |
5 | 103331032400 |
6 | 5322355532 |
7 | 1250640446 |
oct | 326030760 |
9 | 126522572 |
10 | 56111600 |
11 | 29745526 |
12 | 1695bba8 |
13 | b81813c |
14 | 7648b96 |
15 | 4dd59d5 |
hex | 35831f0 |
56111600 has 60 divisors (see below), whose sum is σ = 135846960. Its totient is φ = 22272000.
The previous prime is 56111593. The next prime is 56111633. The reversal of 56111600 is 611165.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (20).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 59936 + ... + 60864.
It is an arithmetic number, because the mean of its divisors is an integer number (2264116).
Almost surely, 256111600 is an apocalyptic number.
56111600 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 56111600, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (67923480).
56111600 is an abundant number, since it is smaller than the sum of its proper divisors (79735360).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
56111600 is a wasteful number, since it uses less digits than its factorization.
56111600 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1098 (or 1087 counting only the distinct ones).
The product of its (nonzero) digits is 180, while the sum is 20.
The square root of 56111600 is about 7490.7676509154. The cubic root of 56111600 is about 382.8402144866.
Adding to 56111600 its reverse (611165), we get a palindrome (56722765).
The spelling of 56111600 in words is "fifty-six million, one hundred eleven thousand, six hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •