Base | Representation |
---|---|
bin | 11101011001011110101… |
… | …11011111100000111111 |
3 | 10120120021102221100121202 |
4 | 32230233113133200333 |
5 | 113022202133031421 |
6 | 2052012233450115 |
7 | 132656342231522 |
oct | 16545727374077 |
9 | 3516242840552 |
10 | 1010112002111 |
11 | 35a427989833 |
12 | 14392457093b |
13 | 7433a23c744 |
14 | 36c65402bb9 |
15 | 1b41e39a10b |
hex | eb2f5df83f |
1010112002111 has 2 divisors, whose sum is σ = 1010112002112. Its totient is φ = 1010112002110.
The previous prime is 1010112002093. The next prime is 1010112002117. The reversal of 1010112002111 is 1112002110101.
It is a strong prime.
It is an emirp because it is prime and its reverse (1112002110101) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1010112002111 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1010112002092 and 1010112002101.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1010112002117) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 505056001055 + 505056001056.
It is an arithmetic number, because the mean of its divisors is an integer number (505056001056).
Almost surely, 21010112002111 is an apocalyptic number.
1010112002111 is a deficient number, since it is larger than the sum of its proper divisors (1).
1010112002111 is an equidigital number, since it uses as much as digits as its factorization.
1010112002111 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 1010112002111 its reverse (1112002110101), we get a palindrome (2122114112212).
The spelling of 1010112002111 in words is "one trillion, ten billion, one hundred twelve million, two thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •