Base | Representation |
---|---|
bin | 100111000110101… |
… | …001111100010000 |
3 | 1200201111002202100 |
4 | 213012221330100 |
5 | 2320422243310 |
6 | 145033320400 |
7 | 22154245641 |
oct | 4706517420 |
9 | 1621432670 |
10 | 656056080 |
11 | 307365709 |
12 | 163866100 |
13 | a5bc4684 |
14 | 631b96c8 |
15 | 3c8e1ec0 |
hex | 271a9f10 |
656056080 has 120 divisors (see below), whose sum is σ = 2250248832. Its totient is φ = 171217152.
The previous prime is 656056043. The next prime is 656056081. The reversal of 656056080 is 80650656.
It is a tau number, because it is divible by the number of its divisors (120).
It is a Harshad number since it is a multiple of its sum of digits (36).
It is not an unprimeable number, because it can be changed into a prime (656056081) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 24147 + ... + 43533.
Almost surely, 2656056080 is an apocalyptic number.
656056080 is a gapful number since it is divisible by the number (60) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 656056080, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1125124416).
656056080 is an abundant number, since it is smaller than the sum of its proper divisors (1594192752).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
656056080 is a wasteful number, since it uses less digits than its factorization.
656056080 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 19453 (or 19444 counting only the distinct ones).
The product of its (nonzero) digits is 43200, while the sum is 36.
The square root of 656056080 is about 25613.5917044057. The cubic root of 656056080 is about 868.9210564606.
The spelling of 656056080 in words is "six hundred fifty-six million, fifty-six thousand, eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •