Base | Representation |
---|---|
bin | 10100110111001010… |
… | …11010010011001000 |
3 | 1001220120011121220001 |
4 | 22123211122103020 |
5 | 140414223210440 |
6 | 5051215212344 |
7 | 544360133551 |
oct | 123345322310 |
9 | 31816147801 |
10 | 11200210120 |
11 | 4828254700 |
12 | 2206b170b4 |
13 | 1096556488 |
14 | 783709328 |
15 | 45843ab9a |
hex | 29b95a4c8 |
11200210120 has 48 divisors (see below), whose sum is σ = 27699705180. Its totient is φ = 4072801920.
The previous prime is 11200210103. The next prime is 11200210139. The reversal of 11200210120 is 2101200211.
It can be written as a sum of positive squares in 2 ways, for example, as 10050864516 + 1149345604 = 100254^2 + 33902^2 .
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 = 11200210097 and 11200210106.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 1152207 + ... + 1161886.
Almost surely, 211200210120 is an apocalyptic number.
11200210120 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
11200210120 is an abundant number, since it is smaller than the sum of its proper divisors (16499495060).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11200210120 is a wasteful number, since it uses less digits than its factorization.
11200210120 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2314126 (or 2314111 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 10.
Adding to 11200210120 its reverse (2101200211), we get a palindrome (13301410331).
Subtracting from 11200210120 its reverse (2101200211), we obtain a palindrome (9099009909).
The spelling of 11200210120 in words is "eleven billion, two hundred million, two hundred ten thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •