Base | Representation |
---|---|
bin | 1001001100011111000110… |
… | …0001011001000110011101 |
3 | 1022210111221221211101212122 |
4 | 2103013301201121012131 |
5 | 2311121001142010414 |
6 | 33300304230512325 |
7 | 2062300645005422 |
oct | 223076141310635 |
9 | 38714857741778 |
10 | 10110110110109 |
11 | 3248745650519 |
12 | 11734a75056a5 |
13 | 5844c13c8929 |
14 | 26d490bb5d49 |
15 | 127ec1a3ab8e |
hex | 931f185919d |
10110110110109 has 8 divisors (see below), whose sum is σ = 10384902190080. Its totient is φ = 9837804836656.
The previous prime is 10110110110099. The next prime is 10110110110117. The reversal of 10110110110109 is 90101101101101.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10110110110109 is a prime.
It is a super-2 number, since 2×101101101101092 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10110110110909) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 621693389 + ... + 621709650.
It is an arithmetic number, because the mean of its divisors is an integer number (1298112773760).
Almost surely, 210110110110109 is an apocalyptic number.
It is an amenable number.
10110110110109 is a deficient number, since it is larger than the sum of its proper divisors (274792079971).
10110110110109 is a wasteful number, since it uses less digits than its factorization.
10110110110109 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1243403259.
The product of its (nonzero) digits is 9, while the sum is 17.
The spelling of 10110110110109 in words is "ten trillion, one hundred ten billion, one hundred ten million, one hundred ten thousand, one hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •