Base | Representation |
---|---|
bin | 10100100000110111… |
… | …01001011001000000 |
3 | 1001102112002111121002 |
4 | 22100123221121000 |
5 | 140023323213440 |
6 | 5020452551132 |
7 | 536625546350 |
oct | 122033513100 |
9 | 31375074532 |
10 | 11013101120 |
11 | 474167696a |
12 | 21743224a8 |
13 | 10668638a8 |
14 | 766920b60 |
15 | 446ccb115 |
hex | 2906e9640 |
11013101120 has 112 divisors (see below), whose sum is σ = 30025531008. Its totient is φ = 3769098240.
The previous prime is 11013101059. The next prime is 11013101131. The reversal of 11013101120 is 2110131011.
It is a happy number.
It is a tau number, because it is divible by the number of its divisors (112).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1324175 + ... + 1332465.
Almost surely, 211013101120 is an apocalyptic number.
11013101120 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 11013101120, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (15012765504).
11013101120 is an abundant number, since it is smaller than the sum of its proper divisors (19012429888).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11013101120 is an equidigital number, since it uses as much as digits as its factorization.
11013101120 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8908 (or 8898 counting only the distinct ones).
The product of its (nonzero) digits is 6, while the sum is 11.
Adding to 11013101120 its reverse (2110131011), we get a palindrome (13123232131).
The spelling of 11013101120 in words is "eleven billion, thirteen million, one hundred one thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •