Base | Representation |
---|---|
bin | 101101011010110000101… |
… | …110001000110000100011 |
3 | 102001101010121020201102011 |
4 | 231122300232020300203 |
5 | 402114013423011121 |
6 | 10345452455333351 |
7 | 441331020654604 |
oct | 55326056106043 |
9 | 12041117221364 |
10 | 3121111141411 |
11 | aa372396588a |
12 | 424a85981257 |
13 | 19841cc991a3 |
14 | ab0c3a3bdab |
15 | 562c20317e1 |
hex | 2d6b0b88c23 |
3121111141411 has 2 divisors, whose sum is σ = 3121111141412. Its totient is φ = 3121111141410.
The previous prime is 3121111141403. The next prime is 3121111141507. The reversal of 3121111141411 is 1141411111213.
It is a m-pointer prime, because the next prime (3121111141507) can be obtained adding 3121111141411 to its product of digits (96).
It is a weak prime.
It is an emirp because it is prime and its reverse (1141411111213) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 3121111141411 - 23 = 3121111141403 is a prime.
It is not a weakly prime, because it can be changed into another prime (3121111141111) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1560555570705 + 1560555570706.
It is an arithmetic number, because the mean of its divisors is an integer number (1560555570706).
Almost surely, 23121111141411 is an apocalyptic number.
3121111141411 is a deficient number, since it is larger than the sum of its proper divisors (1).
3121111141411 is an equidigital number, since it uses as much as digits as its factorization.
3121111141411 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 96, while the sum is 22.
Adding to 3121111141411 its reverse (1141411111213), we get a palindrome (4262522252624).
The spelling of 3121111141411 in words is "three trillion, one hundred twenty-one billion, one hundred eleven million, one hundred forty-one thousand, four hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •