Base | Representation |
---|---|
bin | 10100100001101100… |
… | …00000101001011000 |
3 | 1001110000002121201001 |
4 | 22100312000221120 |
5 | 140032110341440 |
6 | 5021301034344 |
7 | 540041362135 |
oct | 122066005130 |
9 | 31400077631 |
10 | 11020012120 |
11 | 4745567237 |
12 | 21766b59b4 |
13 | 1068113440 |
14 | 7677dd58c |
15 | 4476e3b9a |
hex | 290d80a58 |
11020012120 has 128 divisors (see below), whose sum is σ = 27019137600. Its totient is φ = 4020996096.
The previous prime is 11020012111. The next prime is 11020012139. The reversal of 11020012120 is 2121002011.
It is a Harshad number since it is a multiple of its sum of digits (10).
It is a junction number, because it is equal to n+sod(n) for n = 11020012097 and 11020012106.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 28328886 + ... + 28329274.
Almost surely, 211020012120 is an apocalyptic number.
11020012120 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 11020012120, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (13509568800).
11020012120 is an abundant number, since it is smaller than the sum of its proper divisors (15999125480).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11020012120 is a wasteful number, since it uses less digits than its factorization.
11020012120 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 917 (or 913 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 10.
Adding to 11020012120 its reverse (2121002011), we get a palindrome (13141014131).
The spelling of 11020012120 in words is "eleven billion, twenty million, twelve thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •