Base | Representation |
---|---|
bin | 1101011111111… |
… | …1011001110000 |
3 | 10221112121221100 |
4 | 3113333121300 |
5 | 103443330111 |
6 | 5341324400 |
7 | 1255160541 |
oct | 327773160 |
9 | 127477840 |
10 | 56620656 |
11 | 29a62a34 |
12 | 16b66700 |
13 | b965a61 |
14 | 773c4c8 |
15 | 4e86756 |
hex | 35ff670 |
56620656 has 60 divisors (see below), whose sum is σ = 162757192. Its totient is φ = 18361728.
The previous prime is 56620639. The next prime is 56620661. The reversal of 56620656 is 65602665.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a self number, because there is not a number n which added to its sum of digits gives 56620656.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 15 + ... + 10641.
Almost surely, 256620656 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 56620656, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (81378596).
56620656 is an abundant number, since it is smaller than the sum of its proper divisors (106136536).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
56620656 is a wasteful number, since it uses less digits than its factorization.
56620656 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10678 (or 10669 counting only the distinct ones).
The product of its (nonzero) digits is 64800, while the sum is 36.
The square root of 56620656 is about 7524.6698266436. The cubic root of 56620656 is about 383.9944660661.
Subtracting 56620656 from its reverse (65602665), we obtain a square (8982009 = 29972).
The spelling of 56620656 in words is "fifty-six million, six hundred twenty thousand, six hundred fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •