Base | Representation |
---|---|
bin | 1011101100101000… |
… | …1010100100111101 |
3 | 22002211110201221021 |
4 | 2323022022210331 |
5 | 22412320113112 |
6 | 1235325104141 |
7 | 140545411033 |
oct | 27312124475 |
9 | 8084421837 |
10 | 3140004157 |
11 | 13714a5664 |
12 | 7376b8051 |
13 | 3b06c3734 |
14 | 21b04c553 |
15 | 1359eb907 |
hex | bb28a93d |
3140004157 has 2 divisors, whose sum is σ = 3140004158. Its totient is φ = 3140004156.
The previous prime is 3140004113. The next prime is 3140004187. The reversal of 3140004157 is 7514000413.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2636719801 + 503284356 = 51349^2 + 22434^2 .
It is an emirp because it is prime and its reverse (7514000413) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 3140004157 - 227 = 3005786429 is a prime.
It is a super-2 number, since 2×31400041572 = 19719252211954561298, which contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (3140004187) 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, 1570002078 + 1570002079.
It is an arithmetic number, because the mean of its divisors is an integer number (1570002079).
Almost surely, 23140004157 is an apocalyptic number.
It is an amenable number.
3140004157 is a deficient number, since it is larger than the sum of its proper divisors (1).
3140004157 is an equidigital number, since it uses as much as digits as its factorization.
3140004157 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1680, while the sum is 25.
The square root of 3140004157 is about 56035.7399968984. The cubic root of 3140004157 is about 1464.3449967108.
The spelling of 3140004157 in words is "three billion, one hundred forty million, four thousand, one hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •