Base | Representation |
---|---|
bin | 1101011011010… |
… | …1001100001000 |
3 | 10220222011221222 |
4 | 3112311030020 |
5 | 103404113210 |
6 | 5331021212 |
7 | 1252453400 |
oct | 326651410 |
9 | 126864858 |
10 | 56316680 |
11 | 29875612 |
12 | 16a3a808 |
13 | b88a5a4 |
14 | 769d800 |
15 | 4e26655 |
hex | 35b5308 |
56316680 has 96 divisors (see below), whose sum is σ = 150206400. Its totient is φ = 18942336.
The previous prime is 56316661. The next prime is 56316683. The reversal of 56316680 is 8661365.
It is a Harshad number since it is a multiple of its sum of digits (35).
It is a self number, because there is not a number n which added to its sum of digits gives 56316680.
It is not an unprimeable number, because it can be changed into a prime (56316683) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 115397 + ... + 115883.
It is an arithmetic number, because the mean of its divisors is an integer number (1564650).
Almost surely, 256316680 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 56316680, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (75103200).
56316680 is an abundant number, since it is smaller than the sum of its proper divisors (93889720).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
56316680 is a wasteful number, since it uses less digits than its factorization.
56316680 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 571 (or 560 counting only the distinct ones).
The product of its (nonzero) digits is 25920, while the sum is 35.
The square root of 56316680 is about 7504.4440167144. Note that the first 3 decimals coincide. The cubic root of 56316680 is about 383.3060564502.
The spelling of 56316680 in words is "fifty-six million, three hundred sixteen thousand, six hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •