Base | Representation |
---|---|
bin | 1101100000001… |
… | …0000011001100 |
3 | 10221120011210222 |
4 | 3120002003030 |
5 | 103444202000 |
6 | 5341450512 |
7 | 1255234262 |
oct | 330020314 |
9 | 127504728 |
10 | 56631500 |
11 | 29a700a2 |
12 | 16b70a38 |
13 | b96a983 |
14 | 7742432 |
15 | 4e89a85 |
hex | 36020cc |
56631500 has 48 divisors (see below), whose sum is σ = 124540416. Its totient is φ = 22496000.
The previous prime is 56631499. The next prime is 56631503. The reversal of 56631500 is 513665.
It is a self number, because there is not a number n which added to its sum of digits gives 56631500.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (56631503) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 95204 + ... + 95796.
It is an arithmetic number, because the mean of its divisors is an integer number (2594592).
Almost surely, 256631500 is an apocalyptic number.
56631500 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 56631500, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (62270208).
56631500 is an abundant number, since it is smaller than the sum of its proper divisors (67908916).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
56631500 is a wasteful number, since it uses less digits than its factorization.
56631500 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 803 (or 791 counting only the distinct ones).
The product of its (nonzero) digits is 2700, while the sum is 26.
The square root of 56631500 is about 7525.3903553238. The cubic root of 56631500 is about 384.0189787350.
The spelling of 56631500 in words is "fifty-six million, six hundred thirty-one thousand, five hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •