Base | Representation |
---|---|
bin | 1101011110110… |
… | …1000101110010 |
3 | 10221101211001100 |
4 | 3113231011302 |
5 | 103433430100 |
6 | 5335545230 |
7 | 1254426060 |
oct | 327550562 |
9 | 127354040 |
10 | 56545650 |
11 | 29a11647 |
12 | 16b2b216 |
13 | b93a885 |
14 | 771d030 |
15 | 4e6e400 |
hex | 35ed172 |
56545650 has 144 divisors (see below), whose sum is σ = 179899200. Its totient is φ = 12458880.
The previous prime is 56545637. The next prime is 56545669. The reversal of 56545650 is 5654565.
It is a happy number.
56545650 is a `hidden beast` number, since 56 + 545 + 65 + 0 = 666.
It is an alternating number because its digits alternate between odd and even.
It is a Curzon number.
It is an unprimeable number.
It is a polite number, since it can be written in 71 ways as a sum of consecutive naturals, for example, 91041 + ... + 91659.
It is an arithmetic number, because the mean of its divisors is an integer number (1249300).
Almost surely, 256545650 is an apocalyptic number.
56545650 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 56545650, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (89949600).
56545650 is an abundant number, since it is smaller than the sum of its proper divisors (123353550).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
56545650 is a wasteful number, since it uses less digits than its factorization.
56545650 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 673 (or 665 counting only the distinct ones).
The product of its (nonzero) digits is 90000, while the sum is 36.
The square root of 56545650 is about 7519.6841688996. The cubic root of 56545650 is about 383.8248305868.
The spelling of 56545650 in words is "fifty-six million, five hundred forty-five thousand, six hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •