Base | Representation |
---|---|
bin | 1010001011010000… |
… | …0111010001000001 |
3 | 21001100221010221012 |
4 | 2202310013101001 |
5 | 21043240221431 |
6 | 1131015010305 |
7 | 124455651431 |
oct | 24264072101 |
9 | 7040833835 |
10 | 2731570241 |
11 | 118199a174 |
12 | 642969995 |
13 | 346bbb36a |
14 | 1bcad02c1 |
15 | 10ec1e22b |
hex | a2d07441 |
2731570241 has 2 divisors, whose sum is σ = 2731570242. Its totient is φ = 2731570240.
The previous prime is 2731570201. The next prime is 2731570243. The reversal of 2731570241 is 1420751372.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2717432641 + 14137600 = 52129^2 + 3760^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2731570241 is a prime.
It is a super-2 number, since 2×27315702412 = 14922951963033596162, which contains 22 as substring.
Together with 2731570243, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 2731570198 and 2731570207.
It is not a weakly prime, because it can be changed into another prime (2731570243) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1365785120 + 1365785121.
It is an arithmetic number, because the mean of its divisors is an integer number (1365785121).
Almost surely, 22731570241 is an apocalyptic number.
It is an amenable number.
2731570241 is a deficient number, since it is larger than the sum of its proper divisors (1).
2731570241 is an equidigital number, since it uses as much as digits as its factorization.
2731570241 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 11760, while the sum is 32.
The square root of 2731570241 is about 52264.4261520205. The cubic root of 2731570241 is about 1397.8828954995.
The spelling of 2731570241 in words is "two billion, seven hundred thirty-one million, five hundred seventy thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •