Base | Representation |
---|---|
bin | 1010001100000011000111… |
… | …0010110100000111001000 |
3 | 1110122220121022111011120112 |
4 | 2203000301302310013020 |
5 | 2432013410142042300 |
6 | 35454102304413452 |
7 | 2234216505612050 |
oct | 243006162640710 |
9 | 43586538434515 |
10 | 11202110112200 |
11 | 3629874135697 |
12 | 130b064017288 |
13 | 63347b961a17 |
14 | 2aa2839b6560 |
15 | 1465d4ee1e35 |
hex | a3031cb41c8 |
11202110112200 has 96 divisors (see below), whose sum is σ = 29767065202560. Its totient is φ = 3840535296000.
The previous prime is 11202110112143. The next prime is 11202110112217. The reversal of 11202110112200 is 221101120211.
It is a Harshad number since it is a multiple of its sum of digits (14).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 30056189 + ... + 30426611.
It is an arithmetic number, because the mean of its divisors is an integer number (310073595860).
Almost surely, 211202110112200 is an apocalyptic number.
11202110112200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
11202110112200 is an abundant number, since it is smaller than the sum of its proper divisors (18564955090360).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11202110112200 is a wasteful number, since it uses less digits than its factorization.
11202110112200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 392047 (or 392038 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 11202110112200 its reverse (221101120211), we get a palindrome (11423211232411).
The spelling of 11202110112200 in words is "eleven trillion, two hundred two billion, one hundred ten million, one hundred twelve thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.291 sec. • engine limits •