Base | Representation |
---|---|
bin | 111111000010100… |
… | …110100010010110 |
3 | 2201201011000120120 |
4 | 333002212202112 |
5 | 4131224143432 |
6 | 252541012410 |
7 | 35131564125 |
oct | 7702464226 |
9 | 2651130516 |
10 | 1057646742 |
11 | 4a3017719 |
12 | 256254106 |
13 | 13b171c99 |
14 | a0675abc |
15 | 62cbbc2c |
hex | 3f0a6896 |
1057646742 has 32 divisors (see below), whose sum is σ = 2280942720. Its totient is φ = 325846080.
The previous prime is 1057646717. The next prime is 1057646767. The reversal of 1057646742 is 2476467501.
1057646742 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an interprime number because it is at equal distance from previous prime (1057646717) and next prime (1057646767).
It is a super-2 number, since 2×10576467422 = 2237233261726429128, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1057646694 and 1057646703.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 108468 + ... + 117815.
It is an arithmetic number, because the mean of its divisors is an integer number (71279460).
Almost surely, 21057646742 is an apocalyptic number.
1057646742 is an abundant number, since it is smaller than the sum of its proper divisors (1223295978).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1057646742 is a wasteful number, since it uses less digits than its factorization.
1057646742 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 226348.
The product of its (nonzero) digits is 282240, while the sum is 42.
The square root of 1057646742 is about 32521.4812393286. The cubic root of 1057646742 is about 1018.8577312797.
The spelling of 1057646742 in words is "one billion, fifty-seven million, six hundred forty-six thousand, seven hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •