Base | Representation |
---|---|
bin | 111010000110111001010111… |
… | …100001011010101111010101 |
3 | 1020111212100121111002100211001 |
4 | 322012321113201122233111 |
5 | 231444101113240042121 |
6 | 2303310531413143301 |
7 | 104554434133553005 |
oct | 7206712741325725 |
9 | 1214770544070731 |
10 | 255560612424661 |
11 | 7447a713298135 |
12 | 247b543802ab31 |
13 | ac7a3544a9ccb |
14 | 47172b1b4a005 |
15 | 1e82ab842a991 |
hex | e86e5785abd5 |
255560612424661 has 2 divisors, whose sum is σ = 255560612424662. Its totient is φ = 255560612424660.
The previous prime is 255560612424647. The next prime is 255560612424721. The reversal of 255560612424661 is 166424216065552.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 214127059552561 + 41433552872100 = 14633081^2 + 6436890^2 .
It is a cyclic number.
It is not a de Polignac number, because 255560612424661 - 25 = 255560612424629 is a prime.
It is a super-2 number, since 2×2555606124246612 (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 (255560612434661) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 127780306212330 + 127780306212331.
It is an arithmetic number, because the mean of its divisors is an integer number (127780306212331).
Almost surely, 2255560612424661 is an apocalyptic number.
It is an amenable number.
255560612424661 is a deficient number, since it is larger than the sum of its proper divisors (1).
255560612424661 is an equidigital number, since it uses as much as digits as its factorization.
255560612424661 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 20736000, while the sum is 55.
The spelling of 255560612424661 in words is "two hundred fifty-five trillion, five hundred sixty billion, six hundred twelve million, four hundred twenty-four thousand, six hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •