Base | Representation |
---|---|
bin | 101101000111001110010… |
… | …100111111110011011011 |
3 | 101222100222121020022002202 |
4 | 231013032110333303123 |
5 | 401243033023444011 |
6 | 10332103105520415 |
7 | 436656120656333 |
oct | 55071624776333 |
9 | 11870877208082 |
10 | 3100133031131 |
11 | a95839304064 |
12 | 4209b034310b |
13 | 196458a79996 |
14 | aa0938a60c3 |
15 | 559954aa23b |
hex | 2d1ce53fcdb |
3100133031131 has 2 divisors, whose sum is σ = 3100133031132. Its totient is φ = 3100133031130.
The previous prime is 3100133031113. The next prime is 3100133031143. The reversal of 3100133031131 is 1311303310013.
Together with previous prime (3100133031113) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It is an emirp because it is prime and its reverse (1311303310013) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-3100133031131 is a prime.
It is a super-2 number, since 2×31001330311312 (a number of 26 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (3100133031161) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1550066515565 + 1550066515566.
It is an arithmetic number, because the mean of its divisors is an integer number (1550066515566).
Almost surely, 23100133031131 is an apocalyptic number.
3100133031131 is a deficient number, since it is larger than the sum of its proper divisors (1).
3100133031131 is an equidigital number, since it uses as much as digits as its factorization.
3100133031131 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 243, while the sum is 20.
Adding to 3100133031131 its reverse (1311303310013), we get a palindrome (4411436341144).
The spelling of 3100133031131 in words is "three trillion, one hundred billion, one hundred thirty-three million, thirty-one thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •