Base | Representation |
---|---|
bin | 1000000001001100010101010… |
… | …1100001111011111010110011 |
3 | 2201222212212011220012111202112 |
4 | 2000103011111201323322303 |
5 | 1042424324222432444011 |
6 | 5320030030500435535 |
7 | 226565352232413563 |
oct | 20023052541737263 |
9 | 2658785156174675 |
10 | 564261353406131 |
11 | 153877994809867 |
12 | 533517696a8bab |
13 | 1b2b0804300784 |
14 | 9d4a5766cada3 |
15 | 4537aecd7258b |
hex | 201315587beb3 |
564261353406131 has 2 divisors, whose sum is σ = 564261353406132. Its totient is φ = 564261353406130.
The previous prime is 564261353406103. The next prime is 564261353406133. The reversal of 564261353406131 is 131604353162465.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 564261353406131 - 246 = 493892609228467 is a prime.
It is a super-2 number, since 2×5642613534061312 (a number of 30 digits) contains 22 as substring.
Together with 564261353406133, it forms a pair of twin primes.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 564261353406131.
It is not a weakly prime, because it can be changed into another prime (564261353406133) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 282130676703065 + 282130676703066.
It is an arithmetic number, because the mean of its divisors is an integer number (282130676703066).
Almost surely, 2564261353406131 is an apocalyptic number.
564261353406131 is a deficient number, since it is larger than the sum of its proper divisors (1).
564261353406131 is an equidigital number, since it uses as much as digits as its factorization.
564261353406131 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 4665600, while the sum is 50.
The spelling of 564261353406131 in words is "five hundred sixty-four trillion, two hundred sixty-one billion, three hundred fifty-three million, four hundred six thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •