Base | Representation |
---|---|
bin | 1100101110101… |
… | …00101000010101 |
3 | 21102220211122202 |
4 | 12113110220111 |
5 | 204313331414 |
6 | 14332334245 |
7 | 2434406345 |
oct | 627245025 |
9 | 242824582 |
10 | 106777109 |
11 | 5530024a |
12 | 2b914385 |
13 | 1917742a |
14 | 10276d25 |
15 | 95929de |
hex | 65d4a15 |
106777109 has 4 divisors (see below), whose sum is σ = 111419616. Its totient is φ = 102134604.
The previous prime is 106777103. The next prime is 106777123. The reversal of 106777109 is 901777601.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 106777109 - 212 = 106773013 is a prime.
It is a super-2 number, since 2×1067771092 = 22802702012795762, which contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (106777103) 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, 2321219 + ... + 2321264.
It is an arithmetic number, because the mean of its divisors is an integer number (27854904).
Almost surely, 2106777109 is an apocalyptic number.
It is an amenable number.
106777109 is a deficient number, since it is larger than the sum of its proper divisors (4642507).
106777109 is an equidigital number, since it uses as much as digits as its factorization.
106777109 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4642506.
The product of its (nonzero) digits is 18522, while the sum is 38.
The square root of 106777109 is about 10333.3009730676. The cubic root of 106777109 is about 474.4160639716.
The spelling of 106777109 in words is "one hundred six million, seven hundred seventy-seven thousand, one hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •