Base | Representation |
---|---|
bin | 101111101111111010110001… |
… | …100100100000111110100111 |
3 | 1000112112220120102201202012101 |
4 | 233233322301210200332213 |
5 | 210011124233142010434 |
6 | 2022345102252032531 |
7 | 62143036163523556 |
oct | 5757726144407647 |
9 | 1015486512652171 |
10 | 210001110110119 |
11 | 60a04a74a37549 |
12 | 1b677756a62747 |
13 | 90240343c7aa3 |
14 | 39c0172363d9d |
15 | 19429266b3b14 |
hex | befeb1920fa7 |
210001110110119 has 2 divisors, whose sum is σ = 210001110110120. Its totient is φ = 210001110110118.
The previous prime is 210001110110093. The next prime is 210001110110123. The reversal of 210001110110119 is 911011011100012.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 210001110110119 - 213 = 210001110101927 is a prime.
It is a super-2 number, since 2×2100011101101192 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 210001110110096 and 210001110110105.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (210001110110179) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 105000555055059 + 105000555055060.
It is an arithmetic number, because the mean of its divisors is an integer number (105000555055060).
Almost surely, 2210001110110119 is an apocalyptic number.
210001110110119 is a deficient number, since it is larger than the sum of its proper divisors (1).
210001110110119 is an equidigital number, since it uses as much as digits as its factorization.
210001110110119 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 18, while the sum is 19.
The spelling of 210001110110119 in words is "two hundred ten trillion, one billion, one hundred ten million, one hundred ten thousand, one hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •