Base | Representation |
---|---|
bin | 111011001000011000110100… |
… | …101110101101110001101101 |
3 | 1021002210121021222212201020111 |
4 | 323020120310232231301231 |
5 | 233041320221013343112 |
6 | 2321034240043420021 |
7 | 105530540561500216 |
oct | 7310306456556155 |
9 | 1232717258781214 |
10 | 260061154434157 |
11 | 75955352996a2a |
12 | 25201716524611 |
13 | b21587a7c698b |
14 | 483105427c40d |
15 | 200ebc28ce5a7 |
hex | ec8634badc6d |
260061154434157 has 2 divisors, whose sum is σ = 260061154434158. Its totient is φ = 260061154434156.
The previous prime is 260061154434149. The next prime is 260061154434199. The reversal of 260061154434157 is 751434451160062.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 170329279652676 + 89731874781481 = 13051026^2 + 9472691^2 .
It is a cyclic number.
It is not a de Polignac number, because 260061154434157 - 23 = 260061154434149 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 260061154434157.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (260061154431157) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 130030577217078 + 130030577217079.
It is an arithmetic number, because the mean of its divisors is an integer number (130030577217079).
Almost surely, 2260061154434157 is an apocalyptic number.
It is an amenable number.
260061154434157 is a deficient number, since it is larger than the sum of its proper divisors (1).
260061154434157 is an equidigital number, since it uses as much as digits as its factorization.
260061154434157 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 2419200, while the sum is 49.
The spelling of 260061154434157 in words is "two hundred sixty trillion, sixty-one billion, one hundred fifty-four million, four hundred thirty-four thousand, one hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •