Base | Representation |
---|---|
bin | 111111000000011… |
… | …000110000111000 |
3 | 2201200001112000002 |
4 | 333000120300320 |
5 | 4131102103130 |
6 | 252520332132 |
7 | 35123625122 |
oct | 7700306070 |
9 | 2650045002 |
10 | 1057066040 |
11 | 4a27603a8 |
12 | 256014048 |
13 | 13acca884 |
14 | a0564212 |
15 | 62c04b45 |
hex | 3f018c38 |
1057066040 has 32 divisors (see below), whose sum is σ = 2383577280. Its totient is φ = 421905792.
The previous prime is 1057065991. The next prime is 1057066067. The reversal of 1057066040 is 406607501.
It is a super-2 number, since 2×10570660402 = 2234777225842563200, which contains 22 as substring.
It is a zygodrome in base 2.
It is a junction number, because it is equal to n+sod(n) for n = 1057065994 and 1057066012.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 10019 + ... + 47058.
It is an arithmetic number, because the mean of its divisors is an integer number (74486790).
Almost surely, 21057066040 is an apocalyptic number.
1057066040 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1057066040 is an abundant number, since it is smaller than the sum of its proper divisors (1326511240).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1057066040 is a wasteful number, since it uses less digits than its factorization.
1057066040 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 57551 (or 57547 counting only the distinct ones).
The product of its (nonzero) digits is 5040, while the sum is 29.
The square root of 1057066040 is about 32512.5520376362. The cubic root of 1057066040 is about 1018.6712288575.
The spelling of 1057066040 in words is "one billion, fifty-seven million, sixty-six thousand, forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •