Base | Representation |
---|---|
bin | 11001000010001011100011… |
… | …100110001101101010000101 |
3 | 112102211112221200220002022100 |
4 | 121002023203212031222011 |
5 | 103412343332042023414 |
6 | 1030055412241022313 |
7 | 32122351445350443 |
oct | 3102134346155205 |
9 | 472745850802270 |
10 | 110101010111109 |
11 | 32099637975766 |
12 | 10422391624999 |
13 | 495863314b384 |
14 | 1d28cbb1c1b93 |
15 | cadea7479609 |
hex | 6422e398da85 |
110101010111109 has 24 divisors (see below), whose sum is σ = 160255241875872. Its totient is φ = 72837434086560.
The previous prime is 110101010111089. The next prime is 110101010111159. The reversal of 110101010111109 is 901111010101011.
It is not a de Polignac number, because 110101010111109 - 25 = 110101010111077 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 110101010111091 and 110101010111100.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (110101010111159) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 27653682 + ... + 31383564.
It is an arithmetic number, because the mean of its divisors is an integer number (6677301744828).
Almost surely, 2110101010111109 is an apocalyptic number.
It is an amenable number.
110101010111109 is a deficient number, since it is larger than the sum of its proper divisors (50154231764763).
110101010111109 is a wasteful number, since it uses less digits than its factorization.
110101010111109 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3755057 (or 3755054 counting only the distinct ones).
The product of its (nonzero) digits is 9, while the sum is 18.
The spelling of 110101010111109 in words is "one hundred ten trillion, one hundred one billion, ten million, one hundred eleven thousand, one hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •