Base | Representation |
---|---|
bin | 1100101100101… |
… | …01111110110101 |
3 | 21102102210122202 |
4 | 12112111332311 |
5 | 204232124001 |
6 | 14323034245 |
7 | 2432260253 |
oct | 626257665 |
9 | 242383582 |
10 | 106520501 |
11 | 5514547a |
12 | 2b80b985 |
13 | 190b76a9 |
14 | 1020b5d3 |
15 | 954196b |
hex | 6595fb5 |
106520501 has 8 divisors (see below), whose sum is σ = 109264344. Its totient is φ = 103783680.
The previous prime is 106520489. The next prime is 106520527. The reversal of 106520501 is 105025601.
It can be written as a sum of positive squares in 4 ways, for example, as 15413476 + 91107025 = 3926^2 + 9545^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 106520501 - 218 = 106258357 is a prime.
It is a super-2 number, since 2×1065205012 = 22693234266582002, which contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (106520551) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 43625 + ... + 46001.
It is an arithmetic number, because the mean of its divisors is an integer number (13658043).
Almost surely, 2106520501 is an apocalyptic number.
It is an amenable number.
106520501 is a deficient number, since it is larger than the sum of its proper divisors (2743843).
106520501 is a wasteful number, since it uses less digits than its factorization.
106520501 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3511.
The product of its (nonzero) digits is 300, while the sum is 20.
The square root of 106520501 is about 10320.8769491744. The cubic root of 106520501 is about 474.0357183763.
The spelling of 106520501 in words is "one hundred six million, five hundred twenty thousand, five hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •