Base | Representation |
---|---|
bin | 10101100111011100101101 |
3 | 101122220010021 |
4 | 111213130231 |
5 | 2422312410 |
6 | 321242141 |
7 | 66110500 |
oct | 25473455 |
9 | 11586107 |
10 | 5666605 |
11 | 322044a |
12 | 1a93351 |
13 | 1235329 |
14 | a77137 |
15 | 76deda |
hex | 56772d |
5666605 has 24 divisors (see below), whose sum is σ = 8023320. Its totient is φ = 3830400.
The previous prime is 5666599. The next prime is 5666621. The reversal of 5666605 is 5066665.
5666605 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 4 ways, for example, as 3337929 + 2328676 = 1827^2 + 1526^2 .
It is not a de Polignac number, because 5666605 - 29 = 5666093 is a prime.
It is a super-2 number, since 2×56666052 = 64220824452050, which contains 22 as substring.
It is a Smith number, since the sum of its digits (34) coincides with the sum of the digits of its prime factors.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 24631 + ... + 24859.
It is an arithmetic number, because the mean of its divisors is an integer number (334305).
Almost surely, 25666605 is an apocalyptic number.
It is an amenable number.
5666605 is a deficient number, since it is larger than the sum of its proper divisors (2356715).
5666605 is a wasteful number, since it uses less digits than its factorization.
5666605 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 349 (or 342 counting only the distinct ones).
The product of its (nonzero) digits is 32400, while the sum is 34.
The square root of 5666605 is about 2380.4631902216. The cubic root of 5666605 is about 178.2820613272.
It can be divided in two parts, 566660 and 5, that added together give a palindrome (566665).
The spelling of 5666605 in words is "five million, six hundred sixty-six thousand, six hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.002 sec. • engine limits •