Base | Representation |
---|---|
bin | 11101011101001011110… |
… | …11010101110100111101 |
3 | 10120202102001210120012002 |
4 | 32232211323111310331 |
5 | 113040240341023401 |
6 | 2052541451152045 |
7 | 133056544333223 |
oct | 16564573256475 |
9 | 3522361716162 |
10 | 1012101111101 |
11 | 360258767863 |
12 | 14419a745625 |
13 | 74596372802 |
14 | 36db3664b13 |
15 | 1b4d8d0aa6b |
hex | eba5ed5d3d |
1012101111101 has 2 divisors, whose sum is σ = 1012101111102. Its totient is φ = 1012101111100.
The previous prime is 1012101111011. The next prime is 1012101111157. The reversal of 1012101111101 is 1011111012101.
It is a happy number.
Together with previous prime (1012101111011) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 558754755001 + 453346356100 = 747499^2 + 673310^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1012101111101 is a prime.
It is a congruent number.
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, 506050555550 + 506050555551.
It is an arithmetic number, because the mean of its divisors is an integer number (506050555551).
Almost surely, 21012101111101 is an apocalyptic number.
It is an amenable number.
1012101111101 is a deficient number, since it is larger than the sum of its proper divisors (1).
1012101111101 is an equidigital number, since it uses as much as digits as its factorization.
1012101111101 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 2, while the sum is 11.
Adding to 1012101111101 its reverse (1011111012101), we get a palindrome (2023212123202).
The spelling of 1012101111101 in words is "one trillion, twelve billion, one hundred one million, one hundred eleven thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •