Base | Representation |
---|---|
bin | 1001010101001011… |
… | …1011011001010000 |
3 | 20110120011100110020 |
4 | 2111102323121100 |
5 | 20112210021211 |
6 | 1052313503440 |
7 | 116033111601 |
oct | 22522733120 |
9 | 6416140406 |
10 | 2504767056 |
11 | 107596a620 |
12 | 59aa11b80 |
13 | 30bc0b1ac |
14 | 19a931da8 |
15 | e9d6d306 |
hex | 954bb650 |
2504767056 has 80 divisors (see below), whose sum is σ = 7066690560. Its totient is φ = 758181760.
The previous prime is 2504767051. The next prime is 2504767079. The reversal of 2504767056 is 6507674052.
It is a junction number, because it is equal to n+sod(n) for n = 2504766999 and 2504767017.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2504767051) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 612025 + ... + 616103.
It is an arithmetic number, because the mean of its divisors is an integer number (88333632).
Almost surely, 22504767056 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 2504767056, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (3533345280).
2504767056 is an abundant number, since it is smaller than the sum of its proper divisors (4561923504).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2504767056 is a wasteful number, since it uses less digits than its factorization.
2504767056 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5264 (or 5258 counting only the distinct ones).
The product of its (nonzero) digits is 352800, while the sum is 42.
The square root of 2504767056 is about 50047.6478568174. The cubic root of 2504767056 is about 1358.0709126219.
The spelling of 2504767056 in words is "two billion, five hundred four million, seven hundred sixty-seven thousand, fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •