Base | Representation |
---|---|
bin | 1101011101100… |
… | …1111000010000 |
3 | 10221020211002220 |
4 | 3113121320100 |
5 | 103423420320 |
6 | 5334141040 |
7 | 1253650464 |
oct | 327317020 |
9 | 127224086 |
10 | 56466960 |
11 | 29968510 |
12 | 16ab1780 |
13 | b910b04 |
14 | 76dc4a4 |
15 | 4e55e40 |
hex | 35d9e10 |
56466960 has 160 divisors (see below), whose sum is σ = 194237568. Its totient is φ = 13455360.
The previous prime is 56466959. The next prime is 56466983. The reversal of 56466960 is 6966465.
56466960 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Smith number, since the sum of its digits (42) coincides with the sum of the digits of its prime factors.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 192574 + ... + 192866.
Almost surely, 256466960 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 56466960, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (97118784).
56466960 is an abundant number, since it is smaller than the sum of its proper divisors (137770608).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
56466960 is a wasteful number, since it uses less digits than its factorization.
56466960 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 393 (or 387 counting only the distinct ones).
The product of its (nonzero) digits is 233280, while the sum is 42.
The square root of 56466960 is about 7514.4500796798. The cubic root of 56466960 is about 383.6467019586.
The spelling of 56466960 in words is "fifty-six million, four hundred sixty-six thousand, nine hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •