Base | Representation |
---|---|
bin | 11001000011110010000000… |
… | …000111010101000001000011 |
3 | 112110020001212210111121012002 |
4 | 121003302000013111001003 |
5 | 103421144122104020344 |
6 | 1030222123353054215 |
7 | 32133324401013605 |
oct | 3103620007250103 |
9 | 473201783447162 |
10 | 110211010220099 |
11 | 3213125508a748 |
12 | 1043b7703b736b |
13 | 4965b13685a69 |
14 | 1d303543d3175 |
15 | cb1c9459444e |
hex | 643c801d5043 |
110211010220099 has 2 divisors, whose sum is σ = 110211010220100. Its totient is φ = 110211010220098.
The previous prime is 110211010220093. The next prime is 110211010220167. The reversal of 110211010220099 is 990022010112011.
It is a weak prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-110211010220099 is a prime.
It is not a weakly prime, because it can be changed into another prime (110211010220093) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55105505110049 + 55105505110050.
It is an arithmetic number, because the mean of its divisors is an integer number (55105505110050).
Almost surely, 2110211010220099 is an apocalyptic number.
110211010220099 is a deficient number, since it is larger than the sum of its proper divisors (1).
110211010220099 is an equidigital number, since it uses as much as digits as its factorization.
110211010220099 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 648, while the sum is 29.
The spelling of 110211010220099 in words is "one hundred ten trillion, two hundred eleven billion, ten million, two hundred twenty thousand, ninety-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •