Base | Representation |
---|---|
bin | 110001110000110000… |
… | …1101101001110100101 |
3 | 101012211110110001002100 |
4 | 1203201201231032211 |
5 | 3222323402042314 |
6 | 121031523202313 |
7 | 10502106605232 |
oct | 1434141551645 |
9 | 335743401070 |
10 | 106862924709 |
11 | 41358376002 |
12 | 18864216399 |
13 | a1005c0638 |
14 | 525a6d8789 |
15 | 2ba69c8c09 |
hex | 18e186d3a5 |
106862924709 has 12 divisors (see below), whose sum is σ = 154361323116. Its totient is φ = 71240212032.
The previous prime is 106862924699. The next prime is 106862924717. The reversal of 106862924709 is 907429268601.
106862924709 is a `hidden beast` number, since 1 + 0 + 6 + 8 + 629 + 2 + 4 + 7 + 0 + 9 = 666.
It can be written as a sum of positive squares in 2 ways, for example, as 82381628484 + 24481296225 = 287022^2 + 156465^2 .
It is a de Polignac number, because none of the positive numbers 2k-106862924709 is a prime.
It is a super-2 number, since 2×1068629247092 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (106862920709) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 324799 + ... + 564995.
It is an arithmetic number, because the mean of its divisors is an integer number (12863443593).
Almost surely, 2106862924709 is an apocalyptic number.
It is an amenable number.
106862924709 is a deficient number, since it is larger than the sum of its proper divisors (47498398407).
106862924709 is a wasteful number, since it uses less digits than its factorization.
106862924709 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 289636 (or 289633 counting only the distinct ones).
The product of its (nonzero) digits is 2612736, while the sum is 54.
The spelling of 106862924709 in words is "one hundred six billion, eight hundred sixty-two million, nine hundred twenty-four thousand, seven hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.097 sec. • engine limits •