Base | Representation |
---|---|
bin | 100101010010011111101… |
… | …111000110000010011001 |
3 | 100001222012200000022222011 |
4 | 211102133233012002121 |
5 | 313440424442300012 |
6 | 5241104240425521 |
7 | 353063440166215 |
oct | 45223757060231 |
9 | 10058180008864 |
10 | 2562480431257 |
11 | 8a881844402a |
12 | 3547616182a1 |
13 | 157843ca9716 |
14 | 8c04bb61945 |
15 | 469c8ec61a7 |
hex | 2549fbc6099 |
2562480431257 has 2 divisors, whose sum is σ = 2562480431258. Its totient is φ = 2562480431256.
The previous prime is 2562480431219. The next prime is 2562480431311. The reversal of 2562480431257 is 7521340842652.
2562480431257 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1630552778761 + 931927652496 = 1276931^2 + 965364^2 .
It is a cyclic number.
It is not a de Polignac number, because 2562480431257 - 239 = 2012724617369 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 2562480431257.
It is not a weakly prime, because it can be changed into another prime (2562480435257) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1281240215628 + 1281240215629.
It is an arithmetic number, because the mean of its divisors is an integer number (1281240215629).
Almost surely, 22562480431257 is an apocalyptic number.
It is an amenable number.
2562480431257 is a deficient number, since it is larger than the sum of its proper divisors (1).
2562480431257 is an equidigital number, since it uses as much as digits as its factorization.
2562480431257 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3225600, while the sum is 49.
The spelling of 2562480431257 in words is "two trillion, five hundred sixty-two billion, four hundred eighty million, four hundred thirty-one thousand, two hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •