Base | Representation |
---|---|
bin | 10100000010001100000 |
3 | 1020100112002 |
4 | 2200101200 |
5 | 132001410 |
6 | 22023132 |
7 | 5402636 |
oct | 2402140 |
9 | 1210462 |
10 | 656480 |
11 | 409250 |
12 | 277aa8 |
13 | 19ca66 |
14 | 131356 |
15 | ce7a5 |
hex | a0460 |
656480 has 48 divisors (see below), whose sum is σ = 1696464. Its totient is φ = 238080.
The previous prime is 656479. The next prime is 656483. The reversal of 656480 is 84656.
It is a super-3 number, since 3×6564803 = 848761660133376000, which contains 333 as substring.
It is a congruent number.
It is an inconsummate number, since it does not exist a number n which divided by its sum of digits gives 656480.
It is not an unprimeable number, because it can be changed into a prime (656483) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (5) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1574 + ... + 1946.
It is an arithmetic number, because the mean of its divisors is an integer number (35343).
2656480 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 656480, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (848232).
656480 is an abundant number, since it is smaller than the sum of its proper divisors (1039984).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
656480 is a wasteful number, since it uses less digits than its factorization.
656480 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 399 (or 391 counting only the distinct ones).
The product of its (nonzero) digits is 5760, while the sum is 29.
The square root of 656480 is about 810.2345339468. The cubic root of 656480 is about 86.9108171412.
The spelling of 656480 in words is "six hundred fifty-six thousand, four hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •