Base | Representation |
---|---|
bin | 1100100100111… |
… | …01000101001101 |
3 | 21100112000011122 |
4 | 12102131011031 |
5 | 204002013010 |
6 | 14245130325 |
7 | 2420513051 |
oct | 622350515 |
9 | 240460148 |
10 | 105501005 |
11 | 54609515 |
12 | 2b3b99a5 |
13 | 18b1b63c |
14 | 10023c61 |
15 | 93de855 |
hex | 649d14d |
105501005 has 8 divisors (see below), whose sum is σ = 128990232. Its totient is φ = 82808128.
The previous prime is 105500999. The next prime is 105501049. The reversal of 105501005 is 500105501.
It can be written as a sum of positive squares in 4 ways, for example, as 44129449 + 61371556 = 6643^2 + 7834^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 105501005 - 210 = 105499981 is a prime.
It is a super-2 number, since 2×1055010052 = 22260924112020050, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is an unprimeable number.
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 7 ways as a sum of consecutive naturals, for example, 198794 + ... + 199323.
It is an arithmetic number, because the mean of its divisors is an integer number (16123779).
Almost surely, 2105501005 is an apocalyptic number.
It is an amenable number.
105501005 is a deficient number, since it is larger than the sum of its proper divisors (23489227).
105501005 is an equidigital number, since it uses as much as digits as its factorization.
105501005 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 398175.
The product of its (nonzero) digits is 125, while the sum is 17.
The square root of 105501005 is about 10271.3682146051. The cubic root of 105501005 is about 472.5185532500.
Adding to 105501005 its reverse (500105501), we get a palindrome (605606506).
The spelling of 105501005 in words is "one hundred five million, five hundred one thousand, five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •