Base | Representation |
---|---|
bin | 100001000111101… |
… | …1111001011100011 |
3 | 2212110012202000012 |
4 | 1002033133023203 |
5 | 4234001344011 |
6 | 302140115135 |
7 | 36353241224 |
oct | 10217371343 |
9 | 2773182005 |
10 | 1111356131 |
11 | 520371346 |
12 | 270235aab |
13 | 1493288a2 |
14 | a785724b |
15 | 6787aa8b |
hex | 423df2e3 |
1111356131 has 2 divisors, whose sum is σ = 1111356132. Its totient is φ = 1111356130.
The previous prime is 1111356101. The next prime is 1111356137. The reversal of 1111356131 is 1316531111.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1111356131 is a prime.
It is a super-2 number, since 2×11113561312 = 2470224899822578322, which contains 22 as substring.
It is a Sophie Germain prime.
It is a junction number, because it is equal to n+sod(n) for n = 1111356097 and 1111356106.
It is not a weakly prime, because it can be changed into another prime (1111356137) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 555678065 + 555678066.
It is an arithmetic number, because the mean of its divisors is an integer number (555678066).
Almost surely, 21111356131 is an apocalyptic number.
1111356131 is a deficient number, since it is larger than the sum of its proper divisors (1).
1111356131 is an equidigital number, since it uses as much as digits as its factorization.
1111356131 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 270, while the sum is 23.
The square root of 1111356131 is about 33337.0084290717. The cubic root of 1111356131 is about 1035.8202964321.
Adding to 1111356131 its reverse (1316531111), we get a palindrome (2427887242).
The spelling of 1111356131 in words is "one billion, one hundred eleven million, three hundred fifty-six thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •