Base | Representation |
---|---|
bin | 1100100101100… |
… | …11010011000101 |
3 | 21100200122000000 |
4 | 12102303103011 |
5 | 204012421010 |
6 | 14251111513 |
7 | 2421342261 |
oct | 622632305 |
9 | 240618000 |
10 | 105592005 |
11 | 54670922 |
12 | 2b442599 |
13 | 18b50b9c |
14 | 100490a1 |
15 | 940b7c0 |
hex | 64b34c5 |
105592005 has 56 divisors (see below), whose sum is σ = 193592160. Its totient is φ = 55248480.
The previous prime is 105591989. The next prime is 105592007. The reversal of 105592005 is 500295501.
It is not a de Polignac number, because 105592005 - 24 = 105591989 is a prime.
It is a super-2 number, since 2×1055920052 = 22299343039840050, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a self number, because there is not a number n which added to its sum of digits gives 105592005.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (105592007) by changing a digit.
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 55 ways as a sum of consecutive naturals, for example, 214810 + ... + 215300.
Almost surely, 2105592005 is an apocalyptic number.
105592005 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
105592005 is a deficient number, since it is larger than the sum of its proper divisors (88000155).
105592005 is an frugal number, since it uses more digits than its factorization.
105592005 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 573 (or 558 counting only the distinct ones).
The product of its (nonzero) digits is 2250, while the sum is 27.
The square root of 105592005 is about 10275.7970493777. The cubic root of 105592005 is about 472.6543713283.
The spelling of 105592005 in words is "one hundred five million, five hundred ninety-two thousand, five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •