Base | Representation |
---|---|
bin | 101111101111001111110… |
… | …1101010001110011011101 |
3 | 212020020022221211211020201 |
4 | 1133132133231101303131 |
5 | 1324444110143221431 |
6 | 21542043013343501 |
7 | 1245011016065104 |
oct | 137363755216335 |
9 | 25206287754221 |
10 | 6561094507741 |
11 | 20aa5a9890864 |
12 | 89b701337b91 |
13 | 387929914867 |
14 | 1897b6db503b |
15 | b5a0846c461 |
hex | 5f79fb51cdd |
6561094507741 has 2 divisors, whose sum is σ = 6561094507742. Its totient is φ = 6561094507740.
The previous prime is 6561094507711. The next prime is 6561094507757. The reversal of 6561094507741 is 1477054901656.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 6535073591641 + 26020916100 = 2556379^2 + 161310^2 .
It is a cyclic number.
It is not a de Polignac number, because 6561094507741 - 221 = 6561092410589 is a prime.
It is a super-2 number, since 2×65610945077412 (a number of 26 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (6561094507711) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 3280547253870 + 3280547253871.
It is an arithmetic number, because the mean of its divisors is an integer number (3280547253871).
Almost surely, 26561094507741 is an apocalyptic number.
It is an amenable number.
6561094507741 is a deficient number, since it is larger than the sum of its proper divisors (1).
6561094507741 is an equidigital number, since it uses as much as digits as its factorization.
6561094507741 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6350400, while the sum is 55.
The spelling of 6561094507741 in words is "six trillion, five hundred sixty-one billion, ninety-four million, five hundred seven thousand, seven hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.123 sec. • engine limits •