Base | Representation |
---|---|
bin | 1011100110010010… |
… | …1011011101000011 |
3 | 22000222102010001222 |
4 | 2321210223131003 |
5 | 22334012301011 |
6 | 1232534545255 |
7 | 140103315212 |
oct | 27144533503 |
9 | 8028363058 |
10 | 3113400131 |
11 | 1358484666 |
12 | 72a80822b |
13 | 3a803a3ca |
14 | 2176c5079 |
15 | 1334e3ddb |
hex | b992b743 |
3113400131 has 2 divisors, whose sum is σ = 3113400132. Its totient is φ = 3113400130.
The previous prime is 3113400119. The next prime is 3113400133. The reversal of 3113400131 is 1310043113.
It is a strong prime.
It is an emirp because it is prime and its reverse (1310043113) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 3113400131 - 214 = 3113383747 is a prime.
It is a super-2 number, since 2×31134001312 = 19386520751421634322, which contains 22 as substring.
Together with 3113400133, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (3113400133) 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, 1556700065 + 1556700066.
It is an arithmetic number, because the mean of its divisors is an integer number (1556700066).
Almost surely, 23113400131 is an apocalyptic number.
3113400131 is a deficient number, since it is larger than the sum of its proper divisors (1).
3113400131 is an equidigital number, since it uses as much as digits as its factorization.
3113400131 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 108, while the sum is 17.
The square root of 3113400131 is about 55797.8505948034. The cubic root of 3113400131 is about 1460.1976543250.
Adding to 3113400131 its reverse (1310043113), we get a palindrome (4423443244).
The spelling of 3113400131 in words is "three billion, one hundred thirteen million, four hundred thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •