Base | Representation |
---|---|
bin | 1011101100111000… |
… | …0101110001010001 |
3 | 22002220102000022002 |
4 | 2323032011301101 |
5 | 22413101024131 |
6 | 1235403123345 |
7 | 140560224506 |
oct | 27316056121 |
9 | 8086360262 |
10 | 3141033041 |
11 | 1372038683 |
12 | 737b13555 |
13 | 3b0993b43 |
14 | 21b2394ad |
15 | 135b516cb |
hex | bb385c51 |
3141033041 has 2 divisors, whose sum is σ = 3141033042. Its totient is φ = 3141033040.
The previous prime is 3141033023. The next prime is 3141033047. The reversal of 3141033041 is 1403301413.
3141033041 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1711890625 + 1429142416 = 41375^2 + 37804^2 .
It is an emirp because it is prime and its reverse (1403301413) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-3141033041 is a prime.
It is not a weakly prime, because it can be changed into another prime (3141033047) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1570516520 + 1570516521.
It is an arithmetic number, because the mean of its divisors is an integer number (1570516521).
Almost surely, 23141033041 is an apocalyptic number.
It is an amenable number.
3141033041 is a deficient number, since it is larger than the sum of its proper divisors (1).
3141033041 is an equidigital number, since it uses as much as digits as its factorization.
3141033041 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 432, while the sum is 20.
The square root of 3141033041 is about 56044.9198500631. The cubic root of 3141033041 is about 1464.5049197059.
Adding to 3141033041 its reverse (1403301413), we get a palindrome (4544334454).
The spelling of 3141033041 in words is "three billion, one hundred forty-one million, thirty-three thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •