Base | Representation |
---|---|
bin | 1100101101100… |
… | …01101110000001 |
3 | 21102122120111121 |
4 | 12112301232001 |
5 | 204244242423 |
6 | 14325312241 |
7 | 2433242425 |
oct | 626615601 |
9 | 242576447 |
10 | 106634113 |
11 | 55212873 |
12 | 2b865681 |
13 | 19127311 |
14 | 1023ab85 |
15 | 956545d |
hex | 65b1b81 |
106634113 has 4 divisors (see below), whose sum is σ = 106661700. Its totient is φ = 106606528.
The previous prime is 106634089. The next prime is 106634123. The reversal of 106634113 is 311436601.
It is a happy number.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 72726784 + 33907329 = 8528^2 + 5823^2 .
It is a cyclic number.
It is not a de Polignac number, because 106634113 - 29 = 106633601 is a prime.
It is a super-2 number, since 2×1066341132 = 22741668110593538, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (106634123) 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 3 ways as a sum of consecutive naturals, for example, 6820 + ... + 16117.
It is an arithmetic number, because the mean of its divisors is an integer number (26665425).
Almost surely, 2106634113 is an apocalyptic number.
It is an amenable number.
106634113 is a deficient number, since it is larger than the sum of its proper divisors (27587).
106634113 is an equidigital number, since it uses as much as digits as its factorization.
106634113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 27586.
The product of its (nonzero) digits is 1296, while the sum is 25.
The square root of 106634113 is about 10326.3794720124. The cubic root of 106634113 is about 474.2041898902.
The spelling of 106634113 in words is "one hundred six million, six hundred thirty-four thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.098 sec. • engine limits •