Base | Representation |
---|---|
bin | 1101100000010… |
… | …1101110001100 |
3 | 10221120221110000 |
4 | 3120011232030 |
5 | 104000142130 |
6 | 5342044300 |
7 | 1255326156 |
oct | 330055614 |
9 | 127527400 |
10 | 56646540 |
11 | 29a80425 |
12 | 16b79690 |
13 | b974782 |
14 | 7747ad6 |
15 | 4e8e260 |
hex | 3605b8c |
56646540 has 120 divisors (see below), whose sum is σ = 180512640. Its totient is φ = 14867712.
The previous prime is 56646529. The next prime is 56646553. The reversal of 56646540 is 4564665.
It is a happy number.
56646540 is a `hidden beast` number, since 5 + 6 + 646 + 5 + 4 + 0 = 666.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a junction number, because it is equal to n+sod(n) for n = 56646495 and 56646504.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 39 ways as a sum of consecutive naturals, for example, 118021 + ... + 118499.
It is an arithmetic number, because the mean of its divisors is an integer number (1504272).
Almost surely, 256646540 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 56646540, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (90256320).
56646540 is an abundant number, since it is smaller than the sum of its proper divisors (123866100).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
56646540 is a wasteful number, since it uses less digits than its factorization.
56646540 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 573 (or 562 counting only the distinct ones).
The product of its (nonzero) digits is 86400, while the sum is 36.
The square root of 56646540 is about 7526.3895726969. The cubic root of 56646540 is about 384.0529712081.
The spelling of 56646540 in words is "fifty-six million, six hundred forty-six thousand, five hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •