Base | Representation |
---|---|
bin | 10100100010010010110… |
… | …000010011111010111011 |
3 | 11222220120202020111021011 |
4 | 110202102300103322323 |
5 | 141110130110124011 |
6 | 3000145050054351 |
7 | 203646064034614 |
oct | 24422260237273 |
9 | 4886522214234 |
10 | 1411211411131 |
11 | 4a4545062425 |
12 | 1a9603a1a3b7 |
13 | a30cc582762 |
14 | 4c4355ccc0b |
15 | 26a9755e621 |
hex | 14892c13ebb |
1411211411131 has 2 divisors, whose sum is σ = 1411211411132. Its totient is φ = 1411211411130.
The previous prime is 1411211411123. The next prime is 1411211411227. The reversal of 1411211411131 is 1311141121141.
It is a m-pointer prime, because the next prime (1411211411227) can be obtained adding 1411211411131 to its product of digits (96).
It is a weak prime.
It is an emirp because it is prime and its reverse (1311141121141) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1411211411131 - 23 = 1411211411123 is a prime.
It is a super-2 number, since 2×14112114111312 (a number of 25 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (1411211411111) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 705605705565 + 705605705566.
It is an arithmetic number, because the mean of its divisors is an integer number (705605705566).
Almost surely, 21411211411131 is an apocalyptic number.
1411211411131 is a deficient number, since it is larger than the sum of its proper divisors (1).
1411211411131 is an equidigital number, since it uses as much as digits as its factorization.
1411211411131 is an evil number, because the sum of its binary digits is even.
The product of its digits is 96, while the sum is 22.
Adding to 1411211411131 its reverse (1311141121141), we get a palindrome (2722352532272).
The spelling of 1411211411131 in words is "one trillion, four hundred eleven billion, two hundred eleven million, four hundred eleven thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •