Base | Representation |
---|---|
bin | 100110110010101110011… |
… | …0100110110111000100001 |
3 | 200212200211012011200111011 |
4 | 1031211130310312320201 |
5 | 1144323120103240442 |
6 | 15201150355420521 |
7 | 1060124211223411 |
oct | 115453464667041 |
9 | 20780735150434 |
10 | 5331611774497 |
11 | 177613a940928 |
12 | 721375bb4741 |
13 | 2c89cc184188 |
14 | 1460a1010641 |
15 | 93a4a282117 |
hex | 4d95cd36e21 |
5331611774497 has 2 divisors, whose sum is σ = 5331611774498. Its totient is φ = 5331611774496.
The previous prime is 5331611774479. The next prime is 5331611774597. The reversal of 5331611774497 is 7944771161335.
Together with previous prime (5331611774479) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 5330723674896 + 888099601 = 2308836^2 + 29801^2 .
It is a cyclic number.
It is not a de Polignac number, because 5331611774497 - 235 = 5297252036129 is a prime.
It is a super-2 number, since 2×53316117744972 (a number of 26 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (5331611774407) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2665805887248 + 2665805887249.
It is an arithmetic number, because the mean of its divisors is an integer number (2665805887249).
Almost surely, 25331611774497 is an apocalyptic number.
It is an amenable number.
5331611774497 is a deficient number, since it is larger than the sum of its proper divisors (1).
5331611774497 is an equidigital number, since it uses as much as digits as its factorization.
5331611774497 is an evil number, because the sum of its binary digits is even.
The product of its digits is 13335840, while the sum is 58.
The spelling of 5331611774497 in words is "five trillion, three hundred thirty-one billion, six hundred eleven million, seven hundred seventy-four thousand, four hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •