Base | Representation |
---|---|
bin | 111110001011111… |
… | …000111011000011 |
3 | 2200201011100012202 |
4 | 332023320323003 |
5 | 4114041213011 |
6 | 251305343415 |
7 | 34565640002 |
oct | 7613707303 |
9 | 2621140182 |
10 | 1043304131 |
11 | 495a10921 |
12 | 251497b6b |
13 | 1381bc92c |
14 | 9c7c0c39 |
15 | 618d723b |
hex | 3e2f8ec3 |
1043304131 has 2 divisors, whose sum is σ = 1043304132. Its totient is φ = 1043304130.
The previous prime is 1043304113. The next prime is 1043304137. The reversal of 1043304131 is 1314033401.
Together with previous prime (1043304113) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 1043304131 - 214 = 1043287747 is a prime.
It is a super-2 number, since 2×10433041312 = 2176967019523330322, which contains 22 as substring.
It is a Sophie Germain prime.
It is not a weakly prime, because it can be changed into another prime (1043304137) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 521652065 + 521652066.
It is an arithmetic number, because the mean of its divisors is an integer number (521652066).
Almost surely, 21043304131 is an apocalyptic number.
1043304131 is a deficient number, since it is larger than the sum of its proper divisors (1).
1043304131 is an equidigital number, since it uses as much as digits as its factorization.
1043304131 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 1043304131 is about 32300.2187453893. The cubic root of 1043304131 is about 1014.2312219173.
Adding to 1043304131 its reverse (1314033401), we get a palindrome (2357337532).
The spelling of 1043304131 in words is "one billion, forty-three million, three hundred four thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •