Base | Representation |
---|---|
bin | 1010001101100011… |
… | …1000000000010001 |
3 | 21002001001202011022 |
4 | 2203120320000101 |
5 | 21103222111212 |
6 | 1132001325225 |
7 | 124633606211 |
oct | 24330700021 |
9 | 7061052138 |
10 | 2741207057 |
11 | 1187381486 |
12 | 646036815 |
13 | 348bb3814 |
14 | 1c00bc241 |
15 | 1109c4772 |
hex | a3638011 |
2741207057 has 2 divisors, whose sum is σ = 2741207058. Its totient is φ = 2741207056.
The previous prime is 2741207033. The next prime is 2741207059. The reversal of 2741207057 is 7507021472.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2703064081 + 38142976 = 51991^2 + 6176^2 .
It is a cyclic number.
It is not a de Polignac number, because 2741207057 - 28 = 2741206801 is a prime.
It is a super-2 number, since 2×27412070572 = 15028432258693202498, which contains 22 as substring.
Together with 2741207059, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (2741207059) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1370603528 + 1370603529.
It is an arithmetic number, because the mean of its divisors is an integer number (1370603529).
Almost surely, 22741207057 is an apocalyptic number.
It is an amenable number.
2741207057 is a deficient number, since it is larger than the sum of its proper divisors (1).
2741207057 is an equidigital number, since it uses as much as digits as its factorization.
2741207057 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 27440, while the sum is 35.
The square root of 2741207057 is about 52356.5378630024. The cubic root of 2741207057 is about 1399.5248484486.
The spelling of 2741207057 in words is "two billion, seven hundred forty-one million, two hundred seven thousand, fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •