Base | Representation |
---|---|
bin | 110010110110011110… |
… | …0001110110101000111 |
3 | 101102212110122212020100 |
4 | 1211230330032311013 |
5 | 3242121142123421 |
6 | 122055555535143 |
7 | 10614060633456 |
oct | 1455474166507 |
9 | 342773585210 |
10 | 109201911111 |
11 | 423486a5117 |
12 | 191b75ba4b3 |
13 | a3b4065b67 |
14 | 53dd1d4b9d |
15 | 2c91eebc26 |
hex | 196cf0ed47 |
109201911111 has 12 divisors (see below), whose sum is σ = 161999231992. Its totient is φ = 70833671856.
The previous prime is 109201911103. The next prime is 109201911113. The reversal of 109201911111 is 111119102901.
It is not a de Polignac number, because 109201911111 - 23 = 109201911103 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 (109201911113) 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, 163966501 + ... + 163967166.
Almost surely, 2109201911111 is an apocalyptic number.
109201911111 is a deficient number, since it is larger than the sum of its proper divisors (52797320881).
109201911111 is a wasteful number, since it uses less digits than its factorization.
109201911111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 327933710 (or 327933707 counting only the distinct ones).
The product of its (nonzero) digits is 162, while the sum is 27.
It can be divided in two parts, 109201911 and 111, that multiplied together give a palindrome (12121412121).
The spelling of 109201911111 in words is "one hundred nine billion, two hundred one million, nine hundred eleven thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •