Base | Representation |
---|---|
bin | 1011000000111101010111… |
… | …1011101100001101011011 |
3 | 1120212210212112002120201211 |
4 | 2300033111323230031123 |
5 | 3041412014103031021 |
6 | 41431432523323551 |
7 | 2356666253314555 |
oct | 260172573541533 |
9 | 46783775076654 |
10 | 12111102002011 |
11 | 394a320387381 |
12 | 14372676805b7 |
13 | 69b0c22bb78c |
14 | 2dc2752a24d5 |
15 | 160086b473e1 |
hex | b03d5eec35b |
12111102002011 has 2 divisors, whose sum is σ = 12111102002012. Its totient is φ = 12111102002010.
The previous prime is 12111102002009. The next prime is 12111102002057. The reversal of 12111102002011 is 11020020111121.
It is a happy number.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 12111102002011 - 21 = 12111102002009 is a prime.
It is a super-2 number, since 2×121111020020112 (a number of 27 digits) contains 22 as substring.
Together with 12111102002009, it forms a pair of twin primes.
It is a junction number, because it is equal to n+sod(n) for n = 12111102001982 and 12111102002000.
It is not a weakly prime, because it can be changed into another prime (12111102002911) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6055551001005 + 6055551001006.
It is an arithmetic number, because the mean of its divisors is an integer number (6055551001006).
Almost surely, 212111102002011 is an apocalyptic number.
12111102002011 is a deficient number, since it is larger than the sum of its proper divisors (1).
12111102002011 is an equidigital number, since it uses as much as digits as its factorization.
12111102002011 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 12111102002011 its reverse (11020020111121), we get a palindrome (23131122113132).
The spelling of 12111102002011 in words is "twelve trillion, one hundred eleven billion, one hundred two million, two thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •