Base | Representation |
---|---|
bin | 1100101001010… |
… | …01000001011101 |
3 | 21101121010110021 |
4 | 12110221001131 |
5 | 204123333310 |
6 | 14305312141 |
7 | 2425421146 |
oct | 624510135 |
9 | 241533407 |
10 | 106074205 |
11 | 54970136 |
12 | 2b635651 |
13 | 18c8c503 |
14 | 10132acd |
15 | 94a45da |
hex | 652905d |
106074205 has 8 divisors (see below), whose sum is σ = 128719800. Its totient is φ = 83905536.
The previous prime is 106074197. The next prime is 106074209. The reversal of 106074205 is 502470601.
It can be written as a sum of positive squares in 4 ways, for example, as 25989604 + 80084601 = 5098^2 + 8949^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 106074205 - 23 = 106074197 is a prime.
It is a super-2 number, since 2×1060742052 = 22503473932764050, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 106074205.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (106074209) 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, 118740 + ... + 119629.
It is an arithmetic number, because the mean of its divisors is an integer number (16089975).
Almost surely, 2106074205 is an apocalyptic number.
It is an amenable number.
106074205 is a deficient number, since it is larger than the sum of its proper divisors (22645595).
106074205 is an equidigital number, since it uses as much as digits as its factorization.
106074205 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 238463.
The product of its (nonzero) digits is 1680, while the sum is 25.
The square root of 106074205 is about 10299.2332238861. The cubic root of 106074205 is about 473.3727586791.
The spelling of 106074205 in words is "one hundred six million, seventy-four thousand, two hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •