Base | Representation |
---|---|
bin | 1101011000010… |
… | …1110011101101 |
3 | 10220121022202000 |
4 | 3112011303231 |
5 | 103331410410 |
6 | 5322522513 |
7 | 1251014520 |
oct | 326056355 |
9 | 126538660 |
10 | 56122605 |
11 | 29752820 |
12 | 16966439 |
13 | b820156 |
14 | 764cbb7 |
15 | 4dd8dc0 |
hex | 3585ced |
56122605 has 64 divisors (see below), whose sum is σ = 124416000. Its totient is φ = 23319360.
The previous prime is 56122603. The next prime is 56122609. The reversal of 56122605 is 50622165.
56122605 is a `hidden beast` number, since 56 + 1 + 2 + 2 + 605 = 666.
It is not a de Polignac number, because 56122605 - 21 = 56122603 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (56122603) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 7696 + ... + 13094.
It is an arithmetic number, because the mean of its divisors is an integer number (1944000).
Almost surely, 256122605 is an apocalyptic number.
56122605 is a gapful number since it is divisible by the number (55) formed by its first and last digit.
It is an amenable number.
56122605 is an abundant number, since it is smaller than the sum of its proper divisors (68293395).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
56122605 is a wasteful number, since it uses less digits than its factorization.
56122605 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5431 (or 5425 counting only the distinct ones).
The product of its (nonzero) digits is 3600, while the sum is 27.
The square root of 56122605 is about 7491.5021858103. The cubic root of 56122605 is about 382.8652412853.
The spelling of 56122605 in words is "fifty-six million, one hundred twenty-two thousand, six hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •