Base | Representation |
---|---|
bin | 10101100110011111000000 |
3 | 101122200201000 |
4 | 111212133000 |
5 | 2422201111 |
6 | 321212000 |
7 | 66063126 |
oct | 25463700 |
9 | 11580630 |
10 | 5662656 |
11 | 321848a |
12 | 1a91000 |
13 | 12335ac |
14 | a75916 |
15 | 76cc56 |
hex | 5667c0 |
5662656 has 112 divisors (see below), whose sum is σ = 17373600. Its totient is φ = 1806336.
The previous prime is 5662637. The next prime is 5662663. The reversal of 5662656 is 6562665.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a plaindrome in base 13.
It is a self number, because there is not a number n which added to its sum of digits gives 5662656.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 50056 + ... + 50168.
Almost surely, 25662656 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 5662656, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (8686800).
5662656 is an abundant number, since it is smaller than the sum of its proper divisors (11710944).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5662656 is a wasteful number, since it uses less digits than its factorization.
5662656 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 163 (or 147 counting only the distinct ones).
The product of its digits is 64800, while the sum is 36.
The square root of 5662656 is about 2379.6335852395. The cubic root of 5662656 is about 178.2406373782.
Subtracting 5662656 from its reverse (6562665), we obtain a palindrome (900009).
The spelling of 5662656 in words is "five million, six hundred sixty-two thousand, six hundred fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •