Base | Representation |
---|---|
bin | 1001100001101010… |
… | …1001000000011011 |
3 | 20121012200011221010 |
4 | 2120122221000123 |
5 | 20214110324124 |
6 | 1101423545003 |
7 | 120240110631 |
oct | 23032510033 |
9 | 6535604833 |
10 | 2557120539 |
11 | 10a2478566 |
12 | 5b445b163 |
13 | 319a0b89c |
14 | 1a387d351 |
15 | ee760529 |
hex | 986a901b |
2557120539 has 8 divisors (see below), whose sum is σ = 3442596352. Its totient is φ = 1688195880.
The previous prime is 2557120537. The next prime is 2557120541. The reversal of 2557120539 is 9350217552.
It is an interprime number because it is at equal distance from previous prime (2557120537) and next prime (2557120541).
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 2557120539 - 21 = 2557120537 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2557120497 and 2557120506.
It is not an unprimeable number, because it can be changed into a prime (2557120537) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4137427 + ... + 4138044.
It is an arithmetic number, because the mean of its divisors is an integer number (430324544).
Almost surely, 22557120539 is an apocalyptic number.
2557120539 is a deficient number, since it is larger than the sum of its proper divisors (885475813).
2557120539 is a wasteful number, since it uses less digits than its factorization.
2557120539 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8275577.
The product of its (nonzero) digits is 94500, while the sum is 39.
The square root of 2557120539 is about 50567.9793841913. The cubic root of 2557120539 is about 1367.4676681448.
The spelling of 2557120539 in words is "two billion, five hundred fifty-seven million, one hundred twenty thousand, five hundred thirty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •