Base | Representation |
---|---|
bin | 1101100010110… |
… | …1010001010011 |
3 | 10221220011122200 |
4 | 3120231101103 |
5 | 104020333111 |
6 | 5345334243 |
7 | 1256602353 |
oct | 330552123 |
9 | 127804580 |
10 | 56808531 |
11 | 2a0810aa |
12 | 17037383 |
13 | ba00420 |
14 | 778ab63 |
15 | 4ec2256 |
hex | 362d453 |
56808531 has 12 divisors (see below), whose sum is σ = 88369008. Its totient is φ = 34959024.
The previous prime is 56808503. The next prime is 56808539. The reversal of 56808531 is 13580865.
56808531 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 56808531 - 27 = 56808403 is a prime.
It is a super-2 number, since 2×568085312 = 6454418388755922, which contains 22 as substring.
It is a hoax number, since the sum of its digits (36) coincides with the sum of the digits of its distinct prime factors.
It is not an unprimeable number, because it can be changed into a prime (56808539) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 242655 + ... + 242888.
It is an arithmetic number, because the mean of its divisors is an integer number (7364084).
Almost surely, 256808531 is an apocalyptic number.
56808531 is a deficient number, since it is larger than the sum of its proper divisors (31560477).
56808531 is a wasteful number, since it uses less digits than its factorization.
56808531 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 485562 (or 485559 counting only the distinct ones).
The product of its (nonzero) digits is 28800, while the sum is 36.
The square root of 56808531 is about 7537.1434244016. The cubic root of 56808531 is about 384.4187123795.
The spelling of 56808531 in words is "fifty-six million, eight hundred eight thousand, five hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.122 sec. • engine limits •