Base | Representation |
---|---|
bin | 100101110110100000110… |
… | …000001110011010000001 |
3 | 100012200000202210021012112 |
4 | 211312200300032122001 |
5 | 320104124431214221 |
6 | 5310541451105105 |
7 | 355632655661402 |
oct | 45664060163201 |
9 | 10180022707175 |
10 | 2601152210561 |
11 | 91316267a213 |
12 | 360154742195 |
13 | 15b397b22b78 |
14 | 8dc79b839a9 |
15 | 479de09615b |
hex | 25da0c0e681 |
2601152210561 has 2 divisors, whose sum is σ = 2601152210562. Its totient is φ = 2601152210560.
The previous prime is 2601152210483. The next prime is 2601152210593. The reversal of 2601152210561 is 1650122511062.
It is an a-pointer prime, because the next prime (2601152210593) can be obtained adding 2601152210561 to its sum of digits (32).
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2206246798336 + 394905412225 = 1485344^2 + 628415^2 .
It is a cyclic number.
It is not a de Polignac number, because 2601152210561 - 226 = 2601085101697 is a prime.
It is not a weakly prime, because it can be changed into another prime (2601152215561) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1300576105280 + 1300576105281.
It is an arithmetic number, because the mean of its divisors is an integer number (1300576105281).
Almost surely, 22601152210561 is an apocalyptic number.
It is an amenable number.
2601152210561 is a deficient number, since it is larger than the sum of its proper divisors (1).
2601152210561 is an equidigital number, since it uses as much as digits as its factorization.
2601152210561 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 7200, while the sum is 32.
The spelling of 2601152210561 in words is "two trillion, six hundred one billion, one hundred fifty-two million, two hundred ten thousand, five hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •