Base | Representation |
---|---|
bin | 10000001011000… |
… | …101100111001111 |
3 | 200220120121021212 |
4 | 100023011213033 |
5 | 1023430421111 |
6 | 42531445035 |
7 | 6503240432 |
oct | 2013054717 |
9 | 626517255 |
10 | 271342031 |
11 | 12a190314 |
12 | 76a5677b |
13 | 442a591c |
14 | 28073819 |
15 | 18c4c98b |
hex | 102c59cf |
271342031 has 2 divisors, whose sum is σ = 271342032. Its totient is φ = 271342030.
The previous prime is 271342013. The next prime is 271342037. The reversal of 271342031 is 130243172.
Together with previous prime (271342013) 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 a de Polignac number, because none of the positive numbers 2k-271342031 is a prime.
It is a super-2 number, since 2×2713420312 = 147252995574409922, which contains 22 as substring.
It is a Sophie Germain prime.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 271341988 and 271342006.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (271342037) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 135671015 + 135671016.
It is an arithmetic number, because the mean of its divisors is an integer number (135671016).
Almost surely, 2271342031 is an apocalyptic number.
271342031 is a deficient number, since it is larger than the sum of its proper divisors (1).
271342031 is an equidigital number, since it uses as much as digits as its factorization.
271342031 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1008, while the sum is 23.
The square root of 271342031 is about 16472.4628091855. The cubic root of 271342031 is about 647.3994962347.
It can be divided in two parts, 2713 and 42031, that added together give a palindrome (44744).
The spelling of 271342031 in words is "two hundred seventy-one million, three hundred forty-two thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •