Base | Representation |
---|---|
bin | 100101100111010101000… |
… | …100011011100001111001 |
3 | 100011002221122101212111002 |
4 | 211213111010123201321 |
5 | 314322233103200431 |
6 | 5255244055214345 |
7 | 354514664635061 |
oct | 45472504334171 |
9 | 10132848355432 |
10 | 2584850053241 |
11 | 907257517125 |
12 | 358b650773b5 |
13 | 15999a594c31 |
14 | 8d170a3a3a1 |
15 | 47387cb73cb |
hex | 259d511b879 |
2584850053241 has 2 divisors, whose sum is σ = 2584850053242. Its totient is φ = 2584850053240.
The previous prime is 2584850053237. The next prime is 2584850053421. The reversal of 2584850053241 is 1423500584852.
2584850053241 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
Together with next prime (2584850053421) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1764657187216 + 820192866025 = 1328404^2 + 905645^2 .
It is a cyclic number.
It is not a de Polignac number, because 2584850053241 - 22 = 2584850053237 is a prime.
It is not a weakly prime, because it can be changed into another prime (2584850053441) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1292425026620 + 1292425026621.
It is an arithmetic number, because the mean of its divisors is an integer number (1292425026621).
Almost surely, 22584850053241 is an apocalyptic number.
It is an amenable number.
2584850053241 is a deficient number, since it is larger than the sum of its proper divisors (1).
2584850053241 is an equidigital number, since it uses as much as digits as its factorization.
2584850053241 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1536000, while the sum is 47.
The spelling of 2584850053241 in words is "two trillion, five hundred eighty-four billion, eight hundred fifty million, fifty-three thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •