Base | Representation |
---|---|
bin | 110011001011101010… |
… | …1001010110000100111 |
3 | 101111201000212112210100 |
4 | 1212113111022300213 |
5 | 3300100222403421 |
6 | 122254322555143 |
7 | 10640514600525 |
oct | 1462725126047 |
9 | 344630775710 |
10 | 109913091111 |
11 | 4268309018a |
12 | 19375808ab3 |
13 | a4984bac25 |
14 | 546983d315 |
15 | 2cd467bc26 |
hex | 199754ac27 |
109913091111 has 12 divisors (see below), whose sum is σ = 158768569960. Its totient is φ = 73272986640.
The previous prime is 109913091103. The next prime is 109913091161. The reversal of 109913091111 is 111190319901.
It is not a de Polignac number, because 109913091111 - 23 = 109913091103 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (109913091161) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 114600 + ... + 482658.
Almost surely, 2109913091111 is an apocalyptic number.
109913091111 is a deficient number, since it is larger than the sum of its proper divisors (48855478849).
109913091111 is a wasteful number, since it uses less digits than its factorization.
109913091111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 401246 (or 401243 counting only the distinct ones).
The product of its (nonzero) digits is 2187, while the sum is 36.
The spelling of 109913091111 in words is "one hundred nine billion, nine hundred thirteen million, ninety-one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •