Base | Representation |
---|---|
bin | 100101000001110010101… |
… | …101110001100101110101 |
3 | 100000020220201210021211102 |
4 | 211001302231301211311 |
5 | 313142212040211321 |
6 | 5224540431215445 |
7 | 351560126454146 |
oct | 45016255614565 |
9 | 10006821707742 |
10 | 2544545241461 |
11 | 8a11544a8523 |
12 | 351197077585 |
13 | 155c4631b692 |
14 | 8b229ba5acd |
15 | 462c9670c0b |
hex | 25072b71975 |
2544545241461 has 2 divisors, whose sum is σ = 2544545241462. Its totient is φ = 2544545241460.
The previous prime is 2544545241253. The next prime is 2544545241463. The reversal of 2544545241461 is 1641425454452.
2544545241461 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., 2152400015236 + 392145226225 = 1467106^2 + 626215^2 .
It is a cyclic number.
It is not a de Polignac number, because 2544545241461 - 210 = 2544545240437 is a prime.
Together with 2544545241463, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2544545241463) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1272272620730 + 1272272620731.
It is an arithmetic number, because the mean of its divisors is an integer number (1272272620731).
Almost surely, 22544545241461 is an apocalyptic number.
It is an amenable number.
2544545241461 is a deficient number, since it is larger than the sum of its proper divisors (1).
2544545241461 is an equidigital number, since it uses as much as digits as its factorization.
2544545241461 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 3072000, while the sum is 47.
The spelling of 2544545241461 in words is "two trillion, five hundred forty-four billion, five hundred forty-five million, two hundred forty-one thousand, four hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •