Base | Representation |
---|---|
bin | 1010000001011101011100… |
… | …0111101001011000101000 |
3 | 1110000112001200221012001010 |
4 | 2200113113013221120220 |
5 | 2421023332224021300 |
6 | 35234335440223520 |
7 | 2215116556212513 |
oct | 240272707513050 |
9 | 43015050835033 |
10 | 11020200220200 |
11 | 3569705801376 |
12 | 129b95690aba0 |
13 | 61c27b432282 |
14 | 2a1548299d7a |
15 | 1419d9cc4a50 |
hex | a05d71e9628 |
11020200220200 has 48 divisors (see below), whose sum is σ = 34162620684480. Its totient is φ = 2938720058560.
The previous prime is 11020200220181. The next prime is 11020200220213. The reversal of 11020200220200 is 202200202011.
It is a super-2 number, since 2×110202002202002 (a number of 27 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (12).
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, 9183499584 + ... + 9183500783.
It is an arithmetic number, because the mean of its divisors is an integer number (711721264260).
Almost surely, 211020200220200 is an apocalyptic number.
11020200220200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
11020200220200 is an abundant number, since it is smaller than the sum of its proper divisors (23142420464280).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11020200220200 is a wasteful number, since it uses less digits than its factorization.
11020200220200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 18367000386 (or 18367000377 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 12.
Adding to 11020200220200 its reverse (202200202011), we get a palindrome (11222400422211).
The spelling of 11020200220200 in words is "eleven trillion, twenty billion, two hundred million, two hundred twenty thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •