Base | Representation |
---|---|
bin | 1011101001000110010… |
… | …1110011000000111100 |
3 | 201010021010011122010200 |
4 | 2322101211303000330 |
5 | 11234110320201340 |
6 | 231514524003500 |
7 | 20310314205111 |
oct | 2722145630074 |
9 | 633233148120 |
10 | 200011100220 |
11 | 77908062a38 |
12 | 3291b390590 |
13 | 15b26707759 |
14 | 9975770908 |
15 | 5309418330 |
hex | 2e9197303c |
200011100220 has 72 divisors (see below), whose sum is σ = 607102685280. Its totient is φ = 53300922240.
The previous prime is 200011100203. The next prime is 200011100221. The reversal of 200011100220 is 22001110002.
It is a super-2 number, since 2×2000111002202 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (200011100221) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 95715 + ... + 639674.
It is an arithmetic number, because the mean of its divisors is an integer number (8431981740).
Almost surely, 2200011100220 is an apocalyptic number.
200011100220 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
200011100220 is an abundant number, since it is smaller than the sum of its proper divisors (407091585060).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
200011100220 is a wasteful number, since it uses less digits than its factorization.
200011100220 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 736915 (or 736910 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 9.
Adding to 200011100220 its reverse (22001110002), we get a palindrome (222012210222).
The spelling of 200011100220 in words is "two hundred billion, eleven million, one hundred thousand, two hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •