Base | Representation |
---|---|
bin | 1101100100011… |
… | …0011010110000 |
3 | 10222002101221200 |
4 | 3121012122300 |
5 | 104032132121 |
6 | 5351451200 |
7 | 1260511563 |
oct | 331063260 |
9 | 128071850 |
10 | 56911536 |
11 | 2a141530 |
12 | 17086b00 |
13 | ba38286 |
14 | 77b64da |
15 | 4ee2a26 |
hex | 36466b0 |
56911536 has 240 divisors, whose sum is σ = 191892480. Its totient is φ = 15552000.
The previous prime is 56911511. The next prime is 56911573. The reversal of 56911536 is 63511965.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a self number, because there is not a number n which added to its sum of digits gives 56911536.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 932946 + ... + 933006.
It is an arithmetic number, because the mean of its divisors is an integer number (799552).
Almost surely, 256911536 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 56911536, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (95946240).
56911536 is an abundant number, since it is smaller than the sum of its proper divisors (134980944).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
56911536 is a wasteful number, since it uses less digits than its factorization.
56911536 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 136 (or 127 counting only the distinct ones).
The product of its digits is 24300, while the sum is 36.
The square root of 56911536 is about 7543.9734888187. The cubic root of 56911536 is about 384.6509142480.
It can be divided in two parts, 5691 and 1536, that added together give a palindrome (7227).
The spelling of 56911536 in words is "fifty-six million, nine hundred eleven thousand, five hundred thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •