Base | Representation |
---|---|
bin | 10000000001011001011… |
… | …000000100110011001001 |
3 | 10220020220100122112102111 |
4 | 100001121120010303021 |
5 | 121014332321023423 |
6 | 2201444133102321 |
7 | 142355040013234 |
oct | 20013130046311 |
9 | 3806810575374 |
10 | 1101011111113 |
11 | 394a33083811 |
12 | 1594724879a1 |
13 | 7ca95405984 |
14 | 3b4098a841b |
15 | 1d98e62960d |
hex | 10059604cc9 |
1101011111113 has 2 divisors, whose sum is σ = 1101011111114. Its totient is φ = 1101011111112.
The previous prime is 1101011111111. The next prime is 1101011111171. The reversal of 1101011111113 is 3111111101011.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1082457129744 + 18553981369 = 1040412^2 + 136213^2 .
It is a cyclic number.
It is not a de Polignac number, because 1101011111113 - 21 = 1101011111111 is a prime.
Together with 1101011111111, it forms a pair of twin primes.
It is a junction number, because it is equal to n+sod(n) for n = 1101011111093 and 1101011111102.
It is not a weakly prime, because it can be changed into another prime (1101011111111) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 550505555556 + 550505555557.
It is an arithmetic number, because the mean of its divisors is an integer number (550505555557).
Almost surely, 21101011111113 is an apocalyptic number.
It is an amenable number.
1101011111113 is a deficient number, since it is larger than the sum of its proper divisors (1).
1101011111113 is an equidigital number, since it uses as much as digits as its factorization.
1101011111113 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 3, while the sum is 13.
Adding to 1101011111113 its reverse (3111111101011), we get a palindrome (4212122212124).
The spelling of 1101011111113 in words is "one trillion, one hundred one billion, eleven million, one hundred eleven thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •