Base | Representation |
---|---|
bin | 1101100010001… |
… | …0110001010000 |
3 | 10221210222122200 |
4 | 3120202301100 |
5 | 104012444040 |
6 | 5344403200 |
7 | 1256333100 |
oct | 330426120 |
9 | 127728580 |
10 | 56765520 |
11 | 2a051859 |
12 | 17016500 |
13 | b9b6986 |
14 | 7779200 |
15 | 4eb4630 |
hex | 3622c50 |
56765520 has 180 divisors, whose sum is σ = 221899860. Its totient is φ = 12966912.
The previous prime is 56765509. The next prime is 56765543. The reversal of 56765520 is 2556765.
It can be written as a sum of positive squares in 2 ways, for example, as 41835024 + 14930496 = 6468^2 + 3864^2 .
It is a tau number, because it is divible by the number of its divisors (180).
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 35 ways as a sum of consecutive naturals, for example, 34476 + ... + 36084.
It is an arithmetic number, because the mean of its divisors is an integer number (1232777).
Almost surely, 256765520 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 56765520, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (110949930).
56765520 is an abundant number, since it is smaller than the sum of its proper divisors (165134340).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
56765520 is a wasteful number, since it uses less digits than its factorization.
56765520 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1642 (or 1626 counting only the distinct ones).
The product of its (nonzero) digits is 63000, while the sum is 36.
The square root of 56765520 is about 7534.2896148210. The cubic root of 56765520 is about 384.3216705707.
The spelling of 56765520 in words is "fifty-six million, seven hundred sixty-five thousand, five hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •