Base | Representation |
---|---|
bin | 101111111110011101111111… |
… | …101010001000000100010111 |
3 | 1000200002111110111011002022222 |
4 | 233332131333222020010113 |
5 | 210124020022011200434 |
6 | 2024432304332412555 |
7 | 62305214324310005 |
oct | 5776357752100427 |
9 | 1020074414132288 |
10 | 211001000100119 |
11 | 61260026854289 |
12 | 1b7b94a801715b |
13 | 9097402956848 |
14 | 3a16707d31a75 |
15 | 195d94844972e |
hex | bfe77fa88117 |
211001000100119 has 2 divisors, whose sum is σ = 211001000100120. Its totient is φ = 211001000100118.
The previous prime is 211001000100089. The next prime is 211001000100221. The reversal of 211001000100119 is 911001000100112.
It is a happy number.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 211001000100119 - 212 = 211001000096023 is a prime.
It is a super-2 number, since 2×2110010001001192 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 211001000100097 and 211001000100106.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (211001000100619) 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, 105500500050059 + 105500500050060.
It is an arithmetic number, because the mean of its divisors is an integer number (105500500050060).
Almost surely, 2211001000100119 is an apocalyptic number.
211001000100119 is a deficient number, since it is larger than the sum of its proper divisors (1).
211001000100119 is an equidigital number, since it uses as much as digits as its factorization.
211001000100119 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 17.
The spelling of 211001000100119 in words is "two hundred eleven trillion, one billion, one hundred thousand, one hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •