Base | Representation |
---|---|
bin | 11101011101001011110… |
… | …11010101110011100011 |
3 | 10120202102001210120001202 |
4 | 32232211323111303203 |
5 | 113040240341023021 |
6 | 2052541451151415 |
7 | 133056544333034 |
oct | 16564573256343 |
9 | 3522361716052 |
10 | 1012101111011 |
11 | 360258767791 |
12 | 14419a74556b |
13 | 74596372763 |
14 | 36db3664a8b |
15 | 1b4d8d0aa0b |
hex | eba5ed5ce3 |
1012101111011 has 2 divisors, whose sum is σ = 1012101111012. Its totient is φ = 1012101111010.
The previous prime is 1012101111001. The next prime is 1012101111101. The reversal of 1012101111011 is 1101111012101.
It is a happy number.
Together with next prime (1012101111101) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It is an emirp because it is prime and its reverse (1101111012101) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1012101111011 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1012101110983 and 1012101111001.
It is not a weakly prime, because it can be changed into another prime (1012101111001) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 506050555505 + 506050555506.
It is an arithmetic number, because the mean of its divisors is an integer number (506050555506).
Almost surely, 21012101111011 is an apocalyptic number.
1012101111011 is a deficient number, since it is larger than the sum of its proper divisors (1).
1012101111011 is an equidigital number, since it uses as much as digits as its factorization.
1012101111011 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2, while the sum is 11.
Adding to 1012101111011 its reverse (1101111012101), we get a palindrome (2113212123112).
The spelling of 1012101111011 in words is "one trillion, twelve billion, one hundred one million, one hundred eleven thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •