Base | Representation |
---|---|
bin | 1100101110001… |
… | …00111010000101 |
3 | 21102210120022120 |
4 | 12113010322011 |
5 | 204304301314 |
6 | 14331120153 |
7 | 2434020525 |
oct | 627047205 |
9 | 242716276 |
10 | 106712709 |
11 | 55266924 |
12 | 2b8a3059 |
13 | 1915401c |
14 | 1025b685 |
15 | 957d8a9 |
hex | 65c4e85 |
106712709 has 32 divisors (see below), whose sum is σ = 154635264. Its totient is φ = 65281920.
The previous prime is 106712693. The next prime is 106712717. The reversal of 106712709 is 907217601.
It is not a de Polignac number, because 106712709 - 24 = 106712693 is a prime.
It is a super-2 number, since 2×1067127092 = 22775204524237362, 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 106712709.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (106712909) 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 31 ways as a sum of consecutive naturals, for example, 189262 + ... + 189824.
It is an arithmetic number, because the mean of its divisors is an integer number (4832352).
Almost surely, 2106712709 is an apocalyptic number.
It is an amenable number.
106712709 is a deficient number, since it is larger than the sum of its proper divisors (47922555).
106712709 is a wasteful number, since it uses less digits than its factorization.
106712709 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 697.
The product of its (nonzero) digits is 5292, while the sum is 33.
The square root of 106712709 is about 10330.1843642793. The cubic root of 106712709 is about 474.3206673110.
The spelling of 106712709 in words is "one hundred six million, seven hundred twelve thousand, seven hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •