Base | Representation |
---|---|
bin | 110001100001100010… |
… | …0001010111111010001 |
3 | 101011111211210120001221 |
4 | 1203003010022333101 |
5 | 3220302034201214 |
6 | 120505105325041 |
7 | 10453332641500 |
oct | 1430304127721 |
9 | 334454716057 |
10 | 106351865809 |
11 | 41115945982 |
12 | 18741036781 |
13 | a04b765a17 |
14 | 520c8a4837 |
15 | 2b76bc8e24 |
hex | 18c310afd1 |
106351865809 has 18 divisors (see below), whose sum is σ = 124270187382. Its totient is φ = 90750240000.
The previous prime is 106351865803. The next prime is 106351865821. The reversal of 106351865809 is 908568153601.
It can be written as a sum of positive squares in 3 ways, for example, as 30270780225 + 76081085584 = 173985^2 + 275828^2 .
It is not a de Polignac number, because 106351865809 - 23 = 106351865801 is a prime.
It is a super-2 number, since 2×1063518658092 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (106351865801) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 17 ways as a sum of consecutive naturals, for example, 35437309 + ... + 35440309.
It is an arithmetic number, because the mean of its divisors is an integer number (6903899299).
Almost surely, 2106351865809 is an apocalyptic number.
It is an amenable number.
106351865809 is a deficient number, since it is larger than the sum of its proper divisors (17918321573).
106351865809 is an frugal number, since it uses more digits than its factorization.
106351865809 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6257 (or 3249 counting only the distinct ones).
The product of its (nonzero) digits is 1555200, while the sum is 52.
The spelling of 106351865809 in words is "one hundred six billion, three hundred fifty-one million, eight hundred sixty-five thousand, eight hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •