Base | Representation |
---|---|
bin | 111011011001110111100000… |
… | …101110111101101110011101 |
3 | 1021021001102202102000102222002 |
4 | 323121313200232331232131 |
5 | 233221010231012244341 |
6 | 2323354132114332045 |
7 | 106013403146016443 |
oct | 7331674056755635 |
9 | 1237042672012862 |
10 | 261262336056221 |
11 | 76278809677185 |
12 | 2537648388a025 |
13 | b2a1c17b3cb26 |
14 | 48732436b0b93 |
15 | 20310761c529b |
hex | ed9de0bbdb9d |
261262336056221 has 2 divisors, whose sum is σ = 261262336056222. Its totient is φ = 261262336056220.
The previous prime is 261262336056133. The next prime is 261262336056287. The reversal of 261262336056221 is 122650633262162.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 255198676053721 + 6063660002500 = 15974939^2 + 2462450^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-261262336056221 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (261262336086221) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 130631168028110 + 130631168028111.
It is an arithmetic number, because the mean of its divisors is an integer number (130631168028111).
Almost surely, 2261262336056221 is an apocalyptic number.
It is an amenable number.
261262336056221 is a deficient number, since it is larger than the sum of its proper divisors (1).
261262336056221 is an equidigital number, since it uses as much as digits as its factorization.
261262336056221 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1866240, while the sum is 47.
The spelling of 261262336056221 in words is "two hundred sixty-one trillion, two hundred sixty-two billion, three hundred thirty-six million, fifty-six thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •