Base | Representation |
---|---|
bin | 101111110001101001100110… |
… | …100001000100101111011111 |
3 | 1000112222021201202000120001202 |
4 | 233301221212201010233133 |
5 | 210020101441130013434 |
6 | 2022515502420430115 |
7 | 62154451130102363 |
oct | 5761514641045737 |
9 | 1015867652016052 |
10 | 210120110001119 |
11 | 60a504903039aa |
12 | 1b69682784833b |
13 | 903231a337486 |
14 | 39c5c209312a3 |
15 | 1945a8d965a7e |
hex | bf1a66844bdf |
210120110001119 has 2 divisors, whose sum is σ = 210120110001120. Its totient is φ = 210120110001118.
The previous prime is 210120110001049. The next prime is 210120110001121. The reversal of 210120110001119 is 911100011021012.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 210120110001119 - 244 = 192527923956703 is a prime.
It is a super-2 number, since 2×2101201100011192 (a number of 29 digits) contains 22 as substring.
Together with 210120110001121, it forms a pair of twin primes.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 210120110001119.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (210120110001199) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 105060055000559 + 105060055000560.
It is an arithmetic number, because the mean of its divisors is an integer number (105060055000560).
Almost surely, 2210120110001119 is an apocalyptic number.
210120110001119 is a deficient number, since it is larger than the sum of its proper divisors (1).
210120110001119 is an equidigital number, since it uses as much as digits as its factorization.
210120110001119 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 36, while the sum is 20.
The spelling of 210120110001119 in words is "two hundred ten trillion, one hundred twenty billion, one hundred ten million, one thousand, one hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •