Base | Representation |
---|---|
bin | 110011010100001110… |
… | …0000011101101010111 |
3 | 101112110000221121120021 |
4 | 1212220130003231113 |
5 | 3301142212004121 |
6 | 122343014450011 |
7 | 10650601323163 |
oct | 1465034035527 |
9 | 345400847507 |
10 | 110200109911 |
11 | 428100a8701 |
12 | 19435963907 |
13 | a512ac2238 |
14 | 54959d3ca3 |
15 | 2cee974641 |
hex | 19a8703b57 |
110200109911 has 2 divisors, whose sum is σ = 110200109912. Its totient is φ = 110200109910.
The previous prime is 110200109909. The next prime is 110200109917. The reversal of 110200109911 is 119901002011.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 110200109911 - 21 = 110200109909 is a prime.
Together with 110200109909, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (110200109917) 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 as a sum of consecutive naturals, namely, 55100054955 + 55100054956.
It is an arithmetic number, because the mean of its divisors is an integer number (55100054956).
Almost surely, 2110200109911 is an apocalyptic number.
110200109911 is a deficient number, since it is larger than the sum of its proper divisors (1).
110200109911 is an equidigital number, since it uses as much as digits as its factorization.
110200109911 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 162, while the sum is 25.
The spelling of 110200109911 in words is "one hundred ten billion, two hundred million, one hundred nine thousand, nine hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •