Base | Representation |
---|---|
bin | 100111111000111000011… |
… | …001000111110011001101 |
3 | 100201001100102120011212211 |
4 | 213320320121013303031 |
5 | 324402321110310433 |
6 | 5455132105230421 |
7 | 402016613066062 |
oct | 47707031076315 |
9 | 10631312504784 |
10 | 2741135244493 |
11 | 967566425508 |
12 | 383300792411 |
13 | 16b646024669 |
14 | 96959036c69 |
15 | 4b4835658cd |
hex | 27e38647ccd |
2741135244493 has 2 divisors, whose sum is σ = 2741135244494. Its totient is φ = 2741135244492.
The previous prime is 2741135244439. The next prime is 2741135244511. The reversal of 2741135244493 is 3944425311472.
Together with previous prime (2741135244439) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2333552594409 + 407582650084 = 1527597^2 + 638422^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2741135244493 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2741135244413) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1370567622246 + 1370567622247.
It is an arithmetic number, because the mean of its divisors is an integer number (1370567622247).
Almost surely, 22741135244493 is an apocalyptic number.
It is an amenable number.
2741135244493 is a deficient number, since it is larger than the sum of its proper divisors (1).
2741135244493 is an equidigital number, since it uses as much as digits as its factorization.
2741135244493 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 2903040, while the sum is 49.
The spelling of 2741135244493 in words is "two trillion, seven hundred forty-one billion, one hundred thirty-five million, two hundred forty-four thousand, four hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •