Base | Representation |
---|---|
bin | 111011011100001100001110… |
… | …011011011101111011001101 |
3 | 1021021121200220210220210120021 |
4 | 323130030032123131323031 |
5 | 233231114242210041432 |
6 | 2323555341052222141 |
7 | 106031055162210343 |
oct | 7334141633357315 |
9 | 1237550823823507 |
10 | 261422016487117 |
11 | 7632a50005a342 |
12 | 253a140846a951 |
13 | b2b3cb4b196b5 |
14 | 487ac70999993 |
15 | 20352bea8a697 |
hex | edc30e6ddecd |
261422016487117 has 2 divisors, whose sum is σ = 261422016487118. Its totient is φ = 261422016487116.
The previous prime is 261422016487063. The next prime is 261422016487129. The reversal of 261422016487117 is 711784610224162.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 150234882477156 + 111187134009961 = 12257034^2 + 10544531^2 .
It is a cyclic number.
It is not a de Polignac number, because 261422016487117 - 219 = 261422015962829 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (261422016487717) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 130711008243558 + 130711008243559.
It is an arithmetic number, because the mean of its divisors is an integer number (130711008243559).
Almost surely, 2261422016487117 is an apocalyptic number.
It is an amenable number.
261422016487117 is a deficient number, since it is larger than the sum of its proper divisors (1).
261422016487117 is an equidigital number, since it uses as much as digits as its factorization.
261422016487117 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1806336, while the sum is 52.
The spelling of 261422016487117 in words is "two hundred sixty-one trillion, four hundred twenty-two billion, sixteen million, four hundred eighty-seven thousand, one hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •