Base | Representation |
---|---|
bin | 1011000000111101010111… |
… | …1011101011110000000011 |
3 | 1120212210212112002111011012 |
4 | 2300033111323223300003 |
5 | 3041412014103001011 |
6 | 41431432523311135 |
7 | 2356666253306231 |
oct | 260172573536003 |
9 | 46783775074135 |
10 | 12111102000131 |
11 | 394a320385a22 |
12 | 143726767b4ab |
13 | 69b0c22ba974 |
14 | 2dc2752a1951 |
15 | 160086b46a8b |
hex | b03d5eebc03 |
12111102000131 has 2 divisors, whose sum is σ = 12111102000132. Its totient is φ = 12111102000130.
The previous prime is 12111102000119. The next prime is 12111102000211. The reversal of 12111102000131 is 13100020111121.
It is a weak prime.
It is an emirp because it is prime and its reverse (13100020111121) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-12111102000131 is a prime.
It is a super-2 number, since 2×121111020001312 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (12111107000131) 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, 6055551000065 + 6055551000066.
It is an arithmetic number, because the mean of its divisors is an integer number (6055551000066).
Almost surely, 212111102000131 is an apocalyptic number.
12111102000131 is a deficient number, since it is larger than the sum of its proper divisors (1).
12111102000131 is an equidigital number, since it uses as much as digits as its factorization.
12111102000131 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 12, while the sum is 14.
Adding to 12111102000131 its reverse (13100020111121), we get a palindrome (25211122111252).
The spelling of 12111102000131 in words is "twelve trillion, one hundred eleven billion, one hundred two million, one hundred thirty-one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •