Base | Representation |
---|---|
bin | 1010001011111100000100… |
… | …1000100111011100111110 |
3 | 1110122201201120220121222010 |
4 | 2202333001020213130332 |
5 | 2432001022310031420 |
6 | 35453150545032050 |
7 | 2234121615133026 |
oct | 242770110473476 |
9 | 43581646817863 |
10 | 11200220002110 |
11 | 3628a94224a37 |
12 | 130a817025626 |
13 | 63323a1b1899 |
14 | 2aa144964a86 |
15 | 1465240d94e0 |
hex | a2fc122773e |
11200220002110 has 32 divisors (see below), whose sum is σ = 26880842363040. Its totient is φ = 2986690405248.
The previous prime is 11200220002043. The next prime is 11200220002117. The reversal of 11200220002110 is 1120002200211.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11200220002117) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 478176 + ... + 4757004.
It is an arithmetic number, because the mean of its divisors is an integer number (840026323845).
Almost surely, 211200220002110 is an apocalyptic number.
11200220002110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
11200220002110 is an abundant number, since it is smaller than the sum of its proper divisors (15680622360930).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11200220002110 is a wasteful number, since it uses less digits than its factorization.
11200220002110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4366092.
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 11200220002110 its reverse (1120002200211), we get a palindrome (12320222202321).
The spelling of 11200220002110 in words is "eleven trillion, two hundred billion, two hundred twenty million, two thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •