Base | Representation |
---|---|
bin | 11110101110000010001… |
… | …000000101110000000111 |
3 | 21110210220001200220002002 |
4 | 132232002020011300013 |
5 | 234041323044214002 |
6 | 4253441403335515 |
7 | 305341563536456 |
oct | 36560210056007 |
9 | 7423801626062 |
10 | 2111012101127 |
11 | 74430332a506 |
12 | 2a116582159b |
13 | 1240b5647487 |
14 | 74260250b9d |
15 | 39da3d97002 |
hex | 1eb82205c07 |
2111012101127 has 2 divisors, whose sum is σ = 2111012101128. Its totient is φ = 2111012101126.
The previous prime is 2111012101103. The next prime is 2111012101207. The reversal of 2111012101127 is 7211012101112.
It is a happy number.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 2111012101127 - 216 = 2111012035591 is a prime.
It is a super-2 number, since 2×21110121011272 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 2111012101099 and 2111012101108.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2111012101427) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1055506050563 + 1055506050564.
It is an arithmetic number, because the mean of its divisors is an integer number (1055506050564).
Almost surely, 22111012101127 is an apocalyptic number.
2111012101127 is a deficient number, since it is larger than the sum of its proper divisors (1).
2111012101127 is an equidigital number, since it uses as much as digits as its factorization.
2111012101127 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 56, while the sum is 20.
Adding to 2111012101127 its reverse (7211012101112), we get a palindrome (9322024202239).
The spelling of 2111012101127 in words is "two trillion, one hundred eleven billion, twelve million, one hundred one thousand, one hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •