Base | Representation |
---|---|
bin | 1100100101101… |
… | …10101101110001 |
3 | 21100201100012101 |
4 | 12102312231301 |
5 | 204013343001 |
6 | 14251300401 |
7 | 2421431134 |
oct | 622665561 |
9 | 240640171 |
10 | 105606001 |
11 | 54680396 |
12 | 2b44a701 |
13 | 18b57377 |
14 | 1005021b |
15 | 9410a01 |
hex | 64b6b71 |
105606001 has 8 divisors (see below), whose sum is σ = 106444800. Its totient is φ = 104770560.
The previous prime is 105605999. The next prime is 105606013. The reversal of 105606001 is 100606501.
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 105606001 - 21 = 105605999 is a prime.
It is a super-3 number, since 3×1056060013 (a number of 25 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 105606001.
It is not an unprimeable number, because it can be changed into a prime (105606101) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 136945 + ... + 137713.
It is an arithmetic number, because the mean of its divisors is an integer number (13305600).
Almost surely, 2105606001 is an apocalyptic number.
It is an amenable number.
105606001 is a deficient number, since it is larger than the sum of its proper divisors (838799).
105606001 is an equidigital number, since it uses as much as digits as its factorization.
105606001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1679.
The product of its (nonzero) digits is 180, while the sum is 19.
The square root of 105606001 is about 10276.4780445442. The cubic root of 105606001 is about 472.6752535227.
It can be divided in two parts, 10560 and 6001, that added together give a palindrome (16561).
The spelling of 105606001 in words is "one hundred five million, six hundred six thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.100 sec. • engine limits •