Base | Representation |
---|---|
bin | 1011101100101101… |
… | …1111010010011011 |
3 | 22002212010100220011 |
4 | 2323023133102123 |
5 | 22412412214011 |
6 | 1235340342351 |
7 | 140551354441 |
oct | 27313372233 |
9 | 8085110804 |
10 | 3140351131 |
11 | 1371712315 |
12 | 7378449b7 |
13 | 3b07b5648 |
14 | 21b0dcb91 |
15 | 135a69621 |
hex | bb2df49b |
3140351131 has 2 divisors, whose sum is σ = 3140351132. Its totient is φ = 3140351130.
The previous prime is 3140351113. The next prime is 3140351153. The reversal of 3140351131 is 1311530413.
Together with previous prime (3140351113) it forms an Ormiston pair, because they use the same digits, order apart.
It is an a-pointer prime, because the next prime (3140351153) can be obtained adding 3140351131 to its sum of digits (22).
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 3140351131 - 211 = 3140349083 is a prime.
It is a super-2 number, since 2×31403511312 = 19723610451945958322, which contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (3140354131) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1570175565 + 1570175566.
It is an arithmetic number, because the mean of its divisors is an integer number (1570175566).
Almost surely, 23140351131 is an apocalyptic number.
3140351131 is a deficient number, since it is larger than the sum of its proper divisors (1).
3140351131 is an equidigital number, since it uses as much as digits as its factorization.
3140351131 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 540, while the sum is 22.
The square root of 3140351131 is about 56038.8359176027. The cubic root of 3140351131 is about 1464.3989319820.
Adding to 3140351131 its reverse (1311530413), we get a palindrome (4451881544).
The spelling of 3140351131 in words is "three billion, one hundred forty million, three hundred fifty-one thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •