Base | Representation |
---|---|
bin | 1101011000000… |
… | …0011011110101 |
3 | 10220120012112220 |
4 | 3112000123311 |
5 | 103330204342 |
6 | 5322232553 |
7 | 1250563410 |
oct | 326003365 |
9 | 126505486 |
10 | 56100597 |
11 | 29738233 |
12 | 16955759 |
13 | b813127 |
14 | 7644b77 |
15 | 4dd25ec |
hex | 35806f5 |
56100597 has 16 divisors (see below), whose sum is σ = 89986560. Its totient is φ = 30370032.
The previous prime is 56100593. The next prime is 56100601. The reversal of 56100597 is 79500165.
56100597 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an interprime number because it is at equal distance from previous prime (56100593) and next prime (56100601).
It is not a de Polignac number, because 56100597 - 22 = 56100593 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (56100593) 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 15 ways as a sum of consecutive naturals, for example, 69903 + ... + 70700.
It is an arithmetic number, because the mean of its divisors is an integer number (5624160).
Almost surely, 256100597 is an apocalyptic number.
56100597 is a gapful number since it is divisible by the number (57) formed by its first and last digit.
It is an amenable number.
56100597 is a deficient number, since it is larger than the sum of its proper divisors (33885963).
56100597 is a wasteful number, since it uses less digits than its factorization.
56100597 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 140632.
The product of its (nonzero) digits is 9450, while the sum is 33.
The square root of 56100597 is about 7490.0331774966. The cubic root of 56100597 is about 382.8151889646.
The spelling of 56100597 in words is "fifty-six million, one hundred thousand, five hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •