Base | Representation |
---|---|
bin | 111101010010111… |
… | …0010010101010000 |
3 | 12022100002111110010 |
4 | 1322211302111100 |
5 | 13203010211330 |
6 | 540030434520 |
7 | 101652611151 |
oct | 17245622520 |
9 | 5270074403 |
10 | 2056725840 |
11 | 965a71624 |
12 | 494962a40 |
13 | 26a148c50 |
14 | 157223928 |
15 | c086a3b0 |
hex | 7a972550 |
2056725840 has 160 divisors (see below), whose sum is σ = 6983303040. Its totient is φ = 497645568.
The previous prime is 2056725833. The next prime is 2056725863. The reversal of 2056725840 is 485276502.
It is a Harshad number since it is a multiple of its sum of digits (39).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 178494 + ... + 189666.
It is an arithmetic number, because the mean of its divisors is an integer number (43645644).
Almost surely, 22056725840 is an apocalyptic number.
2056725840 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 2056725840, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (3491651520).
2056725840 is an abundant number, since it is smaller than the sum of its proper divisors (4926577200).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2056725840 is a wasteful number, since it uses less digits than its factorization.
2056725840 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11261 (or 11255 counting only the distinct ones).
The product of its (nonzero) digits is 134400, while the sum is 39.
The square root of 2056725840 is about 45351.1393462171. The cubic root of 2056725840 is about 1271.7218548510.
The spelling of 2056725840 in words is "two billion, fifty-six million, seven hundred twenty-five thousand, eight hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •