Base | Representation |
---|---|
bin | 111011011111100110011101… |
… | …010000110000111100110101 |
3 | 1021022110002202021221022112001 |
4 | 323133212131100300330311 |
5 | 233243434141302313313 |
6 | 2324255132541055301 |
7 | 106054022024201545 |
oct | 7337463520607465 |
9 | 1238402667838461 |
10 | 261656341057333 |
11 | 7640a916184142 |
12 | 2541a903257531 |
13 | b300119443841 |
14 | 488833d5a7325 |
15 | 203b436622add |
hex | edf99d430f35 |
261656341057333 has 2 divisors, whose sum is σ = 261656341057334. Its totient is φ = 261656341057332.
The previous prime is 261656341057081. The next prime is 261656341057339. The reversal of 261656341057333 is 333750143656162.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 170798708724004 + 90857632333329 = 13068998^2 + 9531927^2 .
It is a cyclic number.
It is not a de Polignac number, because 261656341057333 - 217 = 261656340926261 is a prime.
It is a super-2 number, since 2×2616563410573332 (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 (261656341057339) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 130828170528666 + 130828170528667.
It is an arithmetic number, because the mean of its divisors is an integer number (130828170528667).
Almost surely, 2261656341057333 is an apocalyptic number.
It is an amenable number.
261656341057333 is a deficient number, since it is larger than the sum of its proper divisors (1).
261656341057333 is an equidigital number, since it uses as much as digits as its factorization.
261656341057333 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 24494400, while the sum is 55.
The spelling of 261656341057333 in words is "two hundred sixty-one trillion, six hundred fifty-six billion, three hundred forty-one million, fifty-seven thousand, three hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •