Base | Representation |
---|---|
bin | 111111000001010… |
… | …011010001101001 |
3 | 2201200111200202120 |
4 | 333001103101221 |
5 | 4131132240310 |
6 | 252525421453 |
7 | 35125643631 |
oct | 7701232151 |
9 | 2650450676 |
10 | 1057305705 |
11 | 4a2904475 |
12 | 25610a889 |
13 | 13b0829a1 |
14 | a05c76c1 |
15 | 62c50b70 |
hex | 3f053469 |
1057305705 has 16 divisors (see below), whose sum is σ = 1692144960. Its totient is φ = 563744448.
The previous prime is 1057305679. The next prime is 1057305707. The reversal of 1057305705 is 5075037501.
1057305705 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 1057305705 - 28 = 1057305449 is a prime.
It is a super-3 number, since 3×10573057053 (a number of 28 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is not an unprimeable number, because it can be changed into a prime (1057305707) 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, 68919 + ... + 82851.
It is an arithmetic number, because the mean of its divisors is an integer number (105759060).
Almost surely, 21057305705 is an apocalyptic number.
1057305705 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
1057305705 is a deficient number, since it is larger than the sum of its proper divisors (634839255).
1057305705 is a wasteful number, since it uses less digits than its factorization.
1057305705 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19000.
The product of its (nonzero) digits is 18375, while the sum is 33.
The square root of 1057305705 is about 32516.2375591027. The cubic root of 1057305705 is about 1018.7482096648.
The spelling of 1057305705 in words is "one billion, fifty-seven million, three hundred five thousand, seven hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •