Base | Representation |
---|---|
bin | 1100101001110… |
… | …01000001000101 |
3 | 21101201110022122 |
4 | 12110321001011 |
5 | 204132432332 |
6 | 14310535325 |
7 | 2426113145 |
oct | 624710105 |
9 | 241643278 |
10 | 106139717 |
11 | 54a05382 |
12 | 2b667545 |
13 | 18cb3288 |
14 | 1014c925 |
15 | 94b8c12 |
hex | 6539045 |
106139717 has 8 divisors (see below), whose sum is σ = 109153176. Its totient is φ = 103133952.
The previous prime is 106139713. The next prime is 106139723. The reversal of 106139717 is 717931601.
It can be written as a sum of positive squares in 4 ways, for example, as 47141956 + 58997761 = 6866^2 + 7681^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 106139717 - 22 = 106139713 is a prime.
It is a super-2 number, since 2×1061397172 = 22531279049680178, 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 (106139711) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 36833 + ... + 39609.
It is an arithmetic number, because the mean of its divisors is an integer number (13644147).
Almost surely, 2106139717 is an apocalyptic number.
It is an amenable number.
106139717 is a deficient number, since it is larger than the sum of its proper divisors (3013459).
106139717 is a wasteful number, since it uses less digits than its factorization.
106139717 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3847.
The product of its (nonzero) digits is 7938, while the sum is 35.
The square root of 106139717 is about 10302.4131639146. The cubic root of 106139717 is about 473.4701911448.
The spelling of 106139717 in words is "one hundred six million, one hundred thirty-nine thousand, seven hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •