Base | Representation |
---|---|
bin | 1011101100111100… |
… | …0111111110010101 |
3 | 22002220220210021111 |
4 | 2323033013332111 |
5 | 22413133213323 |
6 | 1235413015021 |
7 | 140562434215 |
oct | 27317077625 |
9 | 8086823244 |
10 | 3141304213 |
11 | 1372203393 |
12 | 738024471 |
13 | 3b0a5a3b8 |
14 | 21b2aa245 |
15 | 135ba6c0d |
hex | bb3c7f95 |
3141304213 has 2 divisors, whose sum is σ = 3141304214. Its totient is φ = 3141304212.
The previous prime is 3141304211. The next prime is 3141304247. The reversal of 3141304213 is 3124031413.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 2855085489 + 286218724 = 53433^2 + 16918^2 .
It is a cyclic number.
It is not a de Polignac number, because 3141304213 - 21 = 3141304211 is a prime.
It is a super-2 number, since 2×31413042132 = 19735584317223098738, which contains 22 as substring.
Together with 3141304211, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (3141304211) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1570652106 + 1570652107.
It is an arithmetic number, because the mean of its divisors is an integer number (1570652107).
Almost surely, 23141304213 is an apocalyptic number.
It is an amenable number.
3141304213 is a deficient number, since it is larger than the sum of its proper divisors (1).
3141304213 is an equidigital number, since it uses as much as digits as its factorization.
3141304213 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 864, while the sum is 22.
The square root of 3141304213 is about 56047.3390358543. The cubic root of 3141304213 is about 1464.5470630915.
Adding to 3141304213 its reverse (3124031413), we get a palindrome (6265335626).
The spelling of 3141304213 in words is "three billion, one hundred forty-one million, three hundred four thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •