Base | Representation |
---|---|
bin | 10100100000110100… |
… | …10110001010000000 |
3 | 1001102111110011221010 |
4 | 22100122112022000 |
5 | 140023231311232 |
6 | 5020441400520 |
7 | 536622626400 |
oct | 122032261200 |
9 | 31374404833 |
10 | 11012760192 |
11 | 4741463805 |
12 | 2174199140 |
13 | 1066774665 |
14 | 766872800 |
15 | 446c600cc |
hex | 290696280 |
11012760192 has 192 divisors, whose sum is σ = 34212831840. Its totient is φ = 3129477120.
The previous prime is 11012760149. The next prime is 11012760193. The reversal of 11012760192 is 29106721011.
It is a tau number, because it is divible by the number of its divisors (192).
It is not an unprimeable number, because it can be changed into a prime (11012760193) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 3705267 + ... + 3708237.
Almost surely, 211012760192 is an apocalyptic number.
11012760192 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 11012760192, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (17106415920).
11012760192 is an abundant number, since it is smaller than the sum of its proper divisors (23200071648).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11012760192 is a wasteful number, since it uses less digits than its factorization.
11012760192 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3199 (or 3180 counting only the distinct ones).
The product of its (nonzero) digits is 1512, while the sum is 30.
The spelling of 11012760192 in words is "eleven billion, twelve million, seven hundred sixty thousand, one hundred ninety-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •