Base | Representation |
---|---|
bin | 1011101100110000… |
… | …0110100100001101 |
3 | 22002212102112120202 |
4 | 2323030012210031 |
5 | 22412432341023 |
6 | 1235344023245 |
7 | 140552624462 |
oct | 27314064415 |
9 | 8085375522 |
10 | 3140512013 |
11 | 1371812181 |
12 | 737901b25 |
13 | 3b0840942 |
14 | 21b141669 |
15 | 135a9c128 |
hex | bb30690d |
3140512013 has 2 divisors, whose sum is σ = 3140512014. Its totient is φ = 3140512012.
The previous prime is 3140511967. The next prime is 3140512027. The reversal of 3140512013 is 3102150413.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2365557769 + 774954244 = 48637^2 + 27838^2 .
It is an emirp because it is prime and its reverse (3102150413) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-3140512013 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (3140512073) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1570256006 + 1570256007.
It is an arithmetic number, because the mean of its divisors is an integer number (1570256007).
Almost surely, 23140512013 is an apocalyptic number.
It is an amenable number.
3140512013 is a deficient number, since it is larger than the sum of its proper divisors (1).
3140512013 is an equidigital number, since it uses as much as digits as its factorization.
3140512013 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 360, while the sum is 20.
The square root of 3140512013 is about 56040.2713501639. The cubic root of 3140512013 is about 1464.4239388890.
Adding to 3140512013 its reverse (3102150413), we get a palindrome (6242662426).
The spelling of 3140512013 in words is "three billion, one hundred forty million, five hundred twelve thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •