Base | Representation |
---|---|
bin | 111111001010011… |
… | …001011010000000 |
3 | 2201211222211112221 |
4 | 333022121122000 |
5 | 4132240040422 |
6 | 253052500424 |
7 | 35155134355 |
oct | 7712313200 |
9 | 2654884487 |
10 | 1059690112 |
11 | 4a4192958 |
12 | 256a7a714 |
13 | 13b709090 |
14 | a0a4862c |
15 | 630723c7 |
hex | 3f299680 |
1059690112 has 64 divisors (see below), whose sum is σ = 2346946560. Its totient is φ = 473287680.
The previous prime is 1059690103. The next prime is 1059690127. The reversal of 1059690112 is 2110969501.
It is a happy number.
It is a tau number, because it is divible by the number of its divisors (64).
It is a super-2 number, since 2×10596901122 = 2245886266941145088, which contains 22 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 41313 + ... + 61855.
It is an arithmetic number, because the mean of its divisors is an integer number (36671040).
Almost surely, 21059690112 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 1059690112, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1173473280).
1059690112 is an abundant number, since it is smaller than the sum of its proper divisors (1287256448).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1059690112 is a wasteful number, since it uses less digits than its factorization.
1059690112 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 20601 (or 20589 counting only the distinct ones).
The product of its (nonzero) digits is 4860, while the sum is 34.
The square root of 1059690112 is about 32552.8817771945. The cubic root of 1059690112 is about 1019.5134524304.
The spelling of 1059690112 in words is "one billion, fifty-nine million, six hundred ninety thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •