Base | Representation |
---|---|
bin | 11001000000101111100011… |
… | …010011101111001111010111 |
3 | 112102111002221220210021221111 |
4 | 121000233203103233033113 |
5 | 103404234022040120434 |
6 | 1025542153411555451 |
7 | 32112253404054061 |
oct | 3100574323571727 |
9 | 472432856707844 |
10 | 110002221020119 |
11 | 3206075301750a |
12 | 104072012bbb87 |
13 | 494c21b48264c |
14 | 1d241c8cd0731 |
15 | cab6246d2964 |
hex | 640be34ef3d7 |
110002221020119 has 2 divisors, whose sum is σ = 110002221020120. Its totient is φ = 110002221020118.
The previous prime is 110002221020113. The next prime is 110002221020123. The reversal of 110002221020119 is 911020122200011.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 110002221020119 - 27 = 110002221019991 is a prime.
It is a super-2 number, since 2×1100022210201192 (a number of 29 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 110002221020119.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (110002221020113) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55001110510059 + 55001110510060.
It is an arithmetic number, because the mean of its divisors is an integer number (55001110510060).
Almost surely, 2110002221020119 is an apocalyptic number.
110002221020119 is a deficient number, since it is larger than the sum of its proper divisors (1).
110002221020119 is an equidigital number, since it uses as much as digits as its factorization.
110002221020119 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 144, while the sum is 22.
The spelling of 110002221020119 in words is "one hundred ten trillion, two billion, two hundred twenty-one million, twenty thousand, one hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.365 sec. • engine limits •