Base | Representation |
---|---|
bin | 11001000010001010100111… |
… | …111111100001000011011111 |
3 | 112102211110101000012211022122 |
4 | 121002022213333201003133 |
5 | 103412334310042024244 |
6 | 1030055125115333155 |
7 | 32122314613450013 |
oct | 3102124777410337 |
9 | 472743330184278 |
10 | 110100010111199 |
11 | 32099174451a59 |
12 | 104221527511bb |
13 | 4958503c11254 |
14 | 1d28c24474543 |
15 | cade497981ee |
hex | 6422a7fe10df |
110100010111199 has 2 divisors, whose sum is σ = 110100010111200. Its totient is φ = 110100010111198.
The previous prime is 110100010111163. The next prime is 110100010111213. The reversal of 110100010111199 is 991111010001011.
It is a strong prime.
It is an emirp because it is prime and its reverse (991111010001011) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-110100010111199 is a prime.
It is a super-2 number, since 2×1101000101111992 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (110100010111499) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55050005055599 + 55050005055600.
It is an arithmetic number, because the mean of its divisors is an integer number (55050005055600).
Almost surely, 2110100010111199 is an apocalyptic number.
110100010111199 is a deficient number, since it is larger than the sum of its proper divisors (1).
110100010111199 is an equidigital number, since it uses as much as digits as its factorization.
110100010111199 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 81, while the sum is 26.
The spelling of 110100010111199 in words is "one hundred ten trillion, one hundred billion, ten million, one hundred eleven thousand, one hundred ninety-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •