Base | Representation |
---|---|
bin | 10100101101110110… |
… | …00110100001011000 |
3 | 1001201010000122202201 |
4 | 22112323012201120 |
5 | 140234213311300 |
6 | 5035343135544 |
7 | 542420345500 |
oct | 122673064130 |
9 | 31633018681 |
10 | 11122010200 |
11 | 47980a2974 |
12 | 21a48a45b4 |
13 | 10832a6532 |
14 | 777190a00 |
15 | 45164066a |
hex | 296ec6858 |
11122010200 has 144 divisors (see below), whose sum is σ = 30781210680. Its totient is φ = 3724439040.
The previous prime is 11122010189. The next prime is 11122010231. The reversal of 11122010200 is 201022111.
It is a super-2 number, since 2×111220102002 (a number of 21 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (10).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 35 ways as a sum of consecutive naturals, for example, 408204 + ... + 434596.
Almost surely, 211122010200 is an apocalyptic number.
11122010200 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 11122010200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (15390605340).
11122010200 is an abundant number, since it is smaller than the sum of its proper divisors (19659200480).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11122010200 is a wasteful number, since it uses less digits than its factorization.
11122010200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 26466 (or 26450 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 10.
Adding to 11122010200 its reverse (201022111), we get a palindrome (11323032311).
The spelling of 11122010200 in words is "eleven billion, one hundred twenty-two million, ten thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •