Base | Representation |
---|---|
bin | 1011010010101011… |
… | …1000011111011001 |
3 | 21211020121212211001 |
4 | 2310222320133121 |
5 | 22201432442223 |
6 | 1220435505001 |
7 | 135054160525 |
oct | 26452703731 |
9 | 7736555731 |
10 | 3031140313 |
11 | 1315aaa643 |
12 | 707158161 |
13 | 393c98566 |
14 | 20a7d0d85 |
15 | 12b1959ad |
hex | b4ab87d9 |
3031140313 has 2 divisors, whose sum is σ = 3031140314. Its totient is φ = 3031140312.
The previous prime is 3031140311. The next prime is 3031140323. The reversal of 3031140313 is 3130411303.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1805230144 + 1225910169 = 42488^2 + 35013^2 .
It is an emirp because it is prime and its reverse (3130411303) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 3031140313 - 21 = 3031140311 is a prime.
Together with 3031140311, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (3031140311) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1515570156 + 1515570157.
It is an arithmetic number, because the mean of its divisors is an integer number (1515570157).
Almost surely, 23031140313 is an apocalyptic number.
It is an amenable number.
3031140313 is a deficient number, since it is larger than the sum of its proper divisors (1).
3031140313 is an equidigital number, since it uses as much as digits as its factorization.
3031140313 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 324, while the sum is 19.
The square root of 3031140313 is about 55055.7927288310. The cubic root of 3031140313 is about 1447.2226364835. Note that the first 3 decimals are identical.
Adding to 3031140313 its reverse (3130411303), we get a palindrome (6161551616).
The spelling of 3031140313 in words is "three billion, thirty-one million, one hundred forty thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •