Base | Representation |
---|---|
bin | 1010000000111110100010… |
… | …0100001110011010110000 |
3 | 1102222201122110020012221220 |
4 | 2200033220210032122300 |
5 | 2420404334131140000 |
6 | 35230444241545040 |
7 | 2214404136010143 |
oct | 240175044163260 |
9 | 42881573205856 |
10 | 11011902990000 |
11 | 3566138181530 |
12 | 129a220045180 |
13 | 61b558450cc3 |
14 | 2a0d9c34005a |
15 | 1416a16661a0 |
hex | a03e890e6b0 |
11011902990000 has 800 divisors, whose sum is σ = 39396194982144. Its totient is φ = 2627358720000.
The previous prime is 11011902989951. The next prime is 11011902990019. The reversal of 11011902990000 is 9920911011.
It is a super-2 number, since 2×110119029900002 (a number of 27 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (33).
It is an unprimeable number.
It is a polite number, since it can be written in 159 ways as a sum of consecutive naturals, for example, 9230429404 + ... + 9230430596.
Almost surely, 211011902990000 is an apocalyptic number.
11011902990000 is a gapful number since it is divisible by the number (10) 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 11011902990000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (19698097491072).
11011902990000 is an abundant number, since it is smaller than the sum of its proper divisors (28384291992144).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11011902990000 is a wasteful number, since it uses less digits than its factorization.
11011902990000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1655 (or 1634 counting only the distinct ones).
The product of its (nonzero) digits is 1458, while the sum is 33.
The spelling of 11011902990000 in words is "eleven trillion, eleven billion, nine hundred two million, nine hundred ninety thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •