Base | Representation |
---|---|
bin | 1100101000101… |
… | …11010011000101 |
3 | 21101110102212101 |
4 | 12110113103011 |
5 | 204114022410 |
6 | 14303552101 |
7 | 2424666403 |
oct | 624272305 |
9 | 241412771 |
10 | 106001605 |
11 | 54920636 |
12 | 2b5bb631 |
13 | 18c65458 |
14 | 10114473 |
15 | 948cd3a |
hex | 65174c5 |
106001605 has 8 divisors (see below), whose sum is σ = 130304664. Its totient is φ = 82732800.
The previous prime is 106001603. The next prime is 106001653. The reversal of 106001605 is 506100601.
It can be written as a sum of positive squares in 4 ways, for example, as 7257636 + 98743969 = 2694^2 + 9937^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 106001605 - 21 = 106001603 is a prime.
It is a super-2 number, since 2×1060016052 = 22472680525152050, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (106001603) 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 7 ways as a sum of consecutive naturals, for example, 258336 + ... + 258745.
It is an arithmetic number, because the mean of its divisors is an integer number (16288083).
Almost surely, 2106001605 is an apocalyptic number.
It is an amenable number.
106001605 is a deficient number, since it is larger than the sum of its proper divisors (24303059).
106001605 is an equidigital number, since it uses as much as digits as its factorization.
106001605 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 517127.
The product of its (nonzero) digits is 180, while the sum is 19.
The square root of 106001605 is about 10295.7080863824. The cubic root of 106001605 is about 473.2647377397.
The spelling of 106001605 in words is "one hundred six million, one thousand, six hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •