Base | Representation |
---|---|
bin | 111101010100000… |
… | …0010001101000000 |
3 | 12022101012102210220 |
4 | 1322220002031000 |
5 | 13203133041021 |
6 | 540051223040 |
7 | 101660614212 |
oct | 17250021500 |
9 | 5271172726 |
10 | 2057315136 |
11 | 966334348 |
12 | 494ba7a80 |
13 | 26a2c4246 |
14 | 1573385b2 |
15 | c0934cc6 |
hex | 7aa02340 |
2057315136 has 112 divisors (see below), whose sum is σ = 5745845760. Its totient is φ = 647861760.
The previous prime is 2057315123. The next prime is 2057315137. The reversal of 2057315136 is 6315137502.
It is a junction number, because it is equal to n+sod(n) for n = 2057315097 and 2057315106.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2057315137) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1994941 + ... + 1995971.
Almost surely, 22057315136 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 2057315136, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2872922880).
2057315136 is an abundant number, since it is smaller than the sum of its proper divisors (3688530624).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2057315136 is a wasteful number, since it uses less digits than its factorization.
2057315136 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1612 (or 1602 counting only the distinct ones).
The product of its (nonzero) digits is 18900, while the sum is 33.
The square root of 2057315136 is about 45357.6359172301. The cubic root of 2057315136 is about 1271.8433017682.
The spelling of 2057315136 in words is "two billion, fifty-seven million, three hundred fifteen thousand, one hundred thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •