Base | Representation |
---|---|
bin | 100100011110010111001… |
… | …110001111001100100001 |
3 | 22212121201111122111001201 |
4 | 210132113032033030201 |
5 | 312031304233303231 |
6 | 5155245510401201 |
7 | 346042324120312 |
oct | 44362716171441 |
9 | 8777644574051 |
10 | 2506503025441 |
11 | 887002682578 |
12 | 34593a960201 |
13 | 152492a5209c |
14 | 8945b624609 |
15 | 452ee9ad161 |
hex | 2479738f321 |
2506503025441 has 2 divisors, whose sum is σ = 2506503025442. Its totient is φ = 2506503025440.
The previous prime is 2506503025253. The next prime is 2506503025447. The reversal of 2506503025441 is 1445203056052.
2506503025441 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2477397300625 + 29105724816 = 1573975^2 + 170604^2 .
It is a cyclic number.
It is not a de Polignac number, because 2506503025441 - 211 = 2506503023393 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 2506503025441.
It is not a weakly prime, because it can be changed into another prime (2506503025447) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1253251512720 + 1253251512721.
It is an arithmetic number, because the mean of its divisors is an integer number (1253251512721).
Almost surely, 22506503025441 is an apocalyptic number.
It is an amenable number.
2506503025441 is a deficient number, since it is larger than the sum of its proper divisors (1).
2506503025441 is an equidigital number, since it uses as much as digits as its factorization.
2506503025441 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 144000, while the sum is 37.
The spelling of 2506503025441 in words is "two trillion, five hundred six billion, five hundred three million, twenty-five thousand, four hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •