Base | Representation |
---|---|
bin | 111111000000111… |
… | …010110111010000 |
3 | 2201200022121121010 |
4 | 333000322313100 |
5 | 4131121040322 |
6 | 252523330520 |
7 | 35125046253 |
oct | 7700726720 |
9 | 2650277533 |
10 | 1057205712 |
11 | 4a2846332 |
12 | 256080a40 |
13 | 13b049314 |
14 | a059d09a |
15 | 62c3120c |
hex | 3f03add0 |
1057205712 has 20 divisors (see below), whose sum is σ = 2731114880. Its totient is φ = 352401888.
The previous prime is 1057205711. The next prime is 1057205717. The reversal of 1057205712 is 2175027501.
It is a super-2 number, since 2×10572057122 = 2235367834970853888, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 1057205712.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1057205711) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 11012512 + ... + 11012607.
It is an arithmetic number, because the mean of its divisors is an integer number (136555744).
Almost surely, 21057205712 is an apocalyptic number.
1057205712 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1057205712 is an abundant number, since it is smaller than the sum of its proper divisors (1673909168).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1057205712 is a wasteful number, since it uses less digits than its factorization.
1057205712 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 22025130 (or 22025124 counting only the distinct ones).
The product of its (nonzero) digits is 4900, while the sum is 30.
The square root of 1057205712 is about 32514.6999371054. The cubic root of 1057205712 is about 1018.7160931568.
The spelling of 1057205712 in words is "one billion, fifty-seven million, two hundred five thousand, seven hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •