Base | Representation |
---|---|
bin | 11101011101001011111… |
… | …11001100001010101111 |
3 | 10120202102010200211021211 |
4 | 32232211333030022233 |
5 | 113040241120320421 |
6 | 2052541524535251 |
7 | 133056556035025 |
oct | 16564577141257 |
9 | 3522363624254 |
10 | 1012102120111 |
11 | 360259296955 |
12 | 14419ab51527 |
13 | 74596636b64 |
14 | 36db3848715 |
15 | 1b4d8e599e1 |
hex | eba5fcc2af |
1012102120111 has 2 divisors, whose sum is σ = 1012102120112. Its totient is φ = 1012102120110.
The previous prime is 1012102120109. The next prime is 1012102120123. The reversal of 1012102120111 is 1110212012101.
It is a happy number.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 1012102120111 - 21 = 1012102120109 is a prime.
Together with 1012102120109, it forms a pair of twin primes.
It is a junction number, because it is equal to n+sod(n) for n = 1012102120091 and 1012102120100.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1012102120151) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 506051060055 + 506051060056.
It is an arithmetic number, because the mean of its divisors is an integer number (506051060056).
Almost surely, 21012102120111 is an apocalyptic number.
1012102120111 is a deficient number, since it is larger than the sum of its proper divisors (1).
1012102120111 is an equidigital number, since it uses as much as digits as its factorization.
1012102120111 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 1012102120111 its reverse (1110212012101), we get a palindrome (2122314132212).
It can be divided in two parts, 10 and 12102120111, that added together give a palindrome (12102120121).
The spelling of 1012102120111 in words is "one trillion, twelve billion, one hundred two million, one hundred twenty thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •