Base | Representation |
---|---|
bin | 111100100100111… |
… | …001100111000000 |
3 | 2121211100200220010 |
4 | 330210321213000 |
5 | 4040133243422 |
6 | 244502544520 |
7 | 34120313403 |
oct | 7444714700 |
9 | 2554320803 |
10 | 1016306112 |
11 | 481750908 |
12 | 244438140 |
13 | 132729183 |
14 | 98d93d3a |
15 | 5e352b0c |
hex | 3c9399c0 |
1016306112 has 56 divisors (see below), whose sum is σ = 2695194000. Its totient is φ = 337985536.
The previous prime is 1016306023. The next prime is 1016306113. The reversal of 1016306112 is 2116036101.
It is a super-2 number, since 2×10163061122 = 2065756226577113088, which contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1016306113) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 80314 + ... + 92102.
Almost surely, 21016306112 is an apocalyptic number.
1016306112 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 1016306112, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1347597000).
1016306112 is an abundant number, since it is smaller than the sum of its proper divisors (1678887888).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1016306112 is a wasteful number, since it uses less digits than its factorization.
1016306112 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 12253 (or 12243 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 21.
The square root of 1016306112 is about 31879.5563331738. The cubic root of 1016306112 is about 1005.4060921683.
The spelling of 1016306112 in words is "one billion, sixteen million, three hundred six thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •