Base | Representation |
---|---|
bin | 111011011110000110100000… |
… | …001100011001110110110101 |
3 | 1021022002020210221202200011001 |
4 | 323132012200030121312311 |
5 | 233240242140110440314 |
6 | 2324135533214043301 |
7 | 106043413605341305 |
oct | 7336064014316665 |
9 | 1238066727680131 |
10 | 261553311030709 |
11 | 7638015543a205 |
12 | 2540294a7a9531 |
13 | b2c34a9c68749 |
14 | 4883367d65605 |
15 | 20389063b2674 |
hex | ede1a0319db5 |
261553311030709 has 2 divisors, whose sum is σ = 261553311030710. Its totient is φ = 261553311030708.
The previous prime is 261553311030643. The next prime is 261553311030743. The reversal of 261553311030709 is 907030113355162.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 254612604862225 + 6940706168484 = 15956585^2 + 2634522^2 .
It is a cyclic number.
It is not a de Polignac number, because 261553311030709 - 211 = 261553311028661 is a prime.
It is a super-2 number, since 2×2615533110307092 (a number of 30 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (261553321030709) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 130776655515354 + 130776655515355.
It is an arithmetic number, because the mean of its divisors is an integer number (130776655515355).
Almost surely, 2261553311030709 is an apocalyptic number.
It is an amenable number.
261553311030709 is a deficient number, since it is larger than the sum of its proper divisors (1).
261553311030709 is an equidigital number, since it uses as much as digits as its factorization.
261553311030709 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 510300, while the sum is 46.
The spelling of 261553311030709 in words is "two hundred sixty-one trillion, five hundred fifty-three billion, three hundred eleven million, thirty thousand, seven hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •