Base | Representation |
---|---|
bin | 11001000010010101000011… |
… | …000101100100001100110011 |
3 | 112102212112020222220202201002 |
4 | 121002111003011210030303 |
5 | 103413030220214200034 |
6 | 1030104215442432215 |
7 | 32123162144003021 |
oct | 3102250305441463 |
9 | 472775228822632 |
10 | 110111202100019 |
11 | 320a2997aa089a |
12 | 1042435696266b |
13 | 4959598849643 |
14 | 1d295a6a3d711 |
15 | cae3a210ce7e |
hex | 642543164333 |
110111202100019 has 8 divisors (see below), whose sum is σ = 112672266412992. Its totient is φ = 107550153181800.
The previous prime is 110111202100001. The next prime is 110111202100027. The reversal of 110111202100019 is 910001202111011.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 110111202100019 - 28 = 110111202099763 is a prime.
It is a super-2 number, since 2×1101112021000192 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (110111202100919) 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 7 ways as a sum of consecutive naturals, for example, 11308952 + ... + 18657834.
It is an arithmetic number, because the mean of its divisors is an integer number (14084033301624).
Almost surely, 2110111202100019 is an apocalyptic number.
110111202100019 is a deficient number, since it is larger than the sum of its proper divisors (2561064312973).
110111202100019 is an equidigital number, since it uses as much as digits as its factorization.
110111202100019 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7697377.
The product of its (nonzero) digits is 36, while the sum is 20.
The spelling of 110111202100019 in words is "one hundred ten trillion, one hundred eleven billion, two hundred two million, one hundred thousand, nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •