Base | Representation |
---|---|
bin | 111111000000010… |
… | …110101000111010 |
3 | 2201200001002001210 |
4 | 333000112220322 |
5 | 4131101313323 |
6 | 252520223550 |
7 | 35123560551 |
oct | 7700265072 |
9 | 2650032053 |
10 | 1057057338 |
11 | 4a2754907 |
12 | 25600abb6 |
13 | 13acc691c |
14 | a0560d98 |
15 | 62c02293 |
hex | 3f016a3a |
1057057338 has 8 divisors (see below), whose sum is σ = 2114114688. Its totient is φ = 352352444.
The previous prime is 1057057327. The next prime is 1057057409. The reversal of 1057057338 is 8337507501.
1057057338 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
1057057338 is an admirable number.
It is a super-2 number, since 2×10570573382 = 2234740431639292488, which contains 22 as substring.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 1057057296 and 1057057305.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 88088106 + ... + 88088117.
It is an arithmetic number, because the mean of its divisors is an integer number (264264336).
Almost surely, 21057057338 is an apocalyptic number.
1057057338 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1057057338 is a wasteful number, since it uses less digits than its factorization.
1057057338 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 176176228.
The product of its (nonzero) digits is 88200, while the sum is 39.
The square root of 1057057338 is about 32512.4182121232. The cubic root of 1057057338 is about 1018.6684335413.
The spelling of 1057057338 in words is "one billion, fifty-seven million, fifty-seven thousand, three hundred thirty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •