Base | Representation |
---|---|
bin | 111101010100000… |
… | …1111111101001110 |
3 | 12022101022022002100 |
4 | 1322220033331032 |
5 | 13203141341340 |
6 | 540052335530 |
7 | 101661240360 |
oct | 17250177516 |
9 | 5271268070 |
10 | 2057371470 |
11 | 966372700 |
12 | 4950145a6 |
13 | 26a313a8b |
14 | 157350d30 |
15 | c0946830 |
hex | 7aa0ff4e |
2057371470 has 288 divisors, whose sum is σ = 6803020224. Its totient is φ = 422231040.
The previous prime is 2057371429. The next prime is 2057371517. The reversal of 2057371470 is 741737502.
2057371470 is a `hidden beast` number, since 2 + 0 + 573 + 7 + 14 + 70 = 666.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 143 ways as a sum of consecutive naturals, for example, 10443412 + ... + 10443608.
It is an arithmetic number, because the mean of its divisors is an integer number (23621598).
Almost surely, 22057371470 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 2057371470, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (3401510112).
2057371470 is an abundant number, since it is smaller than the sum of its proper divisors (4745648754).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2057371470 is a wasteful number, since it uses less digits than its factorization.
2057371470 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 376 (or 362 counting only the distinct ones).
The product of its (nonzero) digits is 41160, while the sum is 36.
The square root of 2057371470 is about 45358.2569109528. The cubic root of 2057371470 is about 1271.8549103230.
The spelling of 2057371470 in words is "two billion, fifty-seven million, three hundred seventy-one thousand, four hundred seventy".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •