Base | Representation |
---|---|
bin | 11101011011010111000… |
… | …00111100000000011011 |
3 | 10120122212202202101212112 |
4 | 32231223200330000123 |
5 | 113031234001023232 |
6 | 2052300322302535 |
7 | 133023344431244 |
oct | 16555340740033 |
9 | 3518782671775 |
10 | 1011121111067 |
11 | 35a8a5564281 |
12 | 143b664b7a4b |
13 | 7446b318a32 |
14 | 36d1d441ccb |
15 | 1b47cc7a4b2 |
hex | eb6b83c01b |
1011121111067 has 2 divisors, whose sum is σ = 1011121111068. Its totient is φ = 1011121111066.
The previous prime is 1011121110971. The next prime is 1011121111069. The reversal of 1011121111067 is 7601111211101.
It is a happy number.
1011121111067 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is an emirp because it is prime and its reverse (7601111211101) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1011121111067 - 218 = 1011120848923 is a prime.
Together with 1011121111069, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (1011121111069) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 505560555533 + 505560555534.
It is an arithmetic number, because the mean of its divisors is an integer number (505560555534).
Almost surely, 21011121111067 is an apocalyptic number.
1011121111067 is a deficient number, since it is larger than the sum of its proper divisors (1).
1011121111067 is an equidigital number, since it uses as much as digits as its factorization.
1011121111067 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 84, while the sum is 23.
Adding to 1011121111067 its reverse (7601111211101), we get a palindrome (8612232322168).
The spelling of 1011121111067 in words is "one trillion, eleven billion, one hundred twenty-one million, one hundred eleven thousand, sixty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •