Base | Representation |
---|---|
bin | 101001110101… |
… | …001111110101 |
3 | 202122010112100 |
4 | 221311033311 |
5 | 10301403010 |
6 | 1031012313 |
7 | 162131601 |
oct | 51651765 |
9 | 22563470 |
10 | 10966005 |
11 | 620aa16 |
12 | 380a099 |
13 | 236c47b |
14 | 1656501 |
15 | e692c0 |
hex | a753f5 |
10966005 has 24 divisors (see below), whose sum is σ = 19119672. Its totient is φ = 5814144.
The previous prime is 10966001. The next prime is 10966013. The reversal of 10966005 is 50066901.
10966005 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 5391684 + 5574321 = 2322^2 + 2361^2 .
It is not a de Polignac number, because 10966005 - 22 = 10966001 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 10966005.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10966001) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 8247 + ... + 9483.
It is an arithmetic number, because the mean of its divisors is an integer number (796653).
Almost surely, 210966005 is an apocalyptic number.
10966005 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
10966005 is a deficient number, since it is larger than the sum of its proper divisors (8153667).
10966005 is a wasteful number, since it uses less digits than its factorization.
10966005 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1445 (or 1442 counting only the distinct ones).
The product of its (nonzero) digits is 1620, while the sum is 27.
The square root of 10966005 is about 3311.4958855478. The cubic root of 10966005 is about 222.1686689934.
The spelling of 10966005 in words is "ten million, nine hundred sixty-six thousand, five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •