Base | Representation |
---|---|
bin | 11001000010001100011111… |
… | …010100100010100011111011 |
3 | 112102211122112112022221220002 |
4 | 121002030133110202203323 |
5 | 103412402410100023344 |
6 | 1030100055513223215 |
7 | 32122415333251301 |
oct | 3102143724424373 |
9 | 472748475287802 |
10 | 110102012111099 |
11 | 3209a001535128 |
12 | 10422611101b0b |
13 | 4958762908988 |
14 | 1d28d742d0271 |
15 | cae01540344e |
hex | 64231f5228fb |
110102012111099 has 16 divisors (see below), whose sum is σ = 113450955416064. Its totient is φ = 106785389798400.
The previous prime is 110102012111081. The next prime is 110102012111173. The reversal of 110102012111099 is 990111210201011.
It is not a de Polignac number, because 110102012111099 - 28 = 110102012110843 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (110102012111029) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 7634897 + ... + 16688189.
It is an arithmetic number, because the mean of its divisors is an integer number (7090684713504).
Almost surely, 2110102012111099 is an apocalyptic number.
110102012111099 is a deficient number, since it is larger than the sum of its proper divisors (3348943304965).
110102012111099 is a wasteful number, since it uses less digits than its factorization.
110102012111099 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9055078.
The product of its (nonzero) digits is 324, while the sum is 29.
The spelling of 110102012111099 in words is "one hundred ten trillion, one hundred two billion, twelve million, one hundred eleven thousand, ninety-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •