Base | Representation |
---|---|
bin | 11101011011100000100… |
… | …01101100101001111111 |
3 | 10120200002100002021210002 |
4 | 32231300101230221333 |
5 | 113031414424031421 |
6 | 2052312254504515 |
7 | 133025334461606 |
oct | 16556021545177 |
9 | 3520070067702 |
10 | 1011201002111 |
11 | 35a936670633 |
12 | 143b8920513b |
13 | 74481a3b641 |
14 | 36d29cbaa3d |
15 | 1b484cabb0b |
hex | eb7046ca7f |
1011201002111 has 2 divisors, whose sum is σ = 1011201002112. Its totient is φ = 1011201002110.
The previous prime is 1011201002101. The next prime is 1011201002131. The reversal of 1011201002111 is 1112001021101.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 1011201002111 - 210 = 1011201001087 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1011201002092 and 1011201002101.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1011201002101) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 505600501055 + 505600501056.
It is an arithmetic number, because the mean of its divisors is an integer number (505600501056).
Almost surely, 21011201002111 is an apocalyptic number.
1011201002111 is a deficient number, since it is larger than the sum of its proper divisors (1).
1011201002111 is an equidigital number, since it uses as much as digits as its factorization.
1011201002111 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 1011201002111 its reverse (1112001021101), we get a palindrome (2123202023212).
The spelling of 1011201002111 in words is "one trillion, eleven billion, two hundred one million, two thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •