Base | Representation |
---|---|
bin | 101101100001011101000001… |
… | …100110011100101101000000 |
3 | 222020212222120220102120202110 |
4 | 231201131001212130231000 |
5 | 202220224112240213440 |
6 | 1545451355243215320 |
7 | 60112524151141602 |
oct | 5541350146345500 |
9 | 866788526376673 |
10 | 200211001101120 |
11 | 588800106a4659 |
12 | 1a556297217540 |
13 | 8793a7c7cc939 |
14 | 376239abc1172 |
15 | 1822e3321e080 |
hex | b6174199cb40 |
200211001101120 has 112 divisors (see below), whose sum is σ = 644377735961280. Its totient is φ = 52658235887616.
The previous prime is 200211001101119. The next prime is 200211001101143. The reversal of 200211001101120 is 21101100112002.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is a junction number, because it is equal to n+sod(n) for n = 200211001101096 and 200211001101105.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1428375990 + ... + 1428516149.
Almost surely, 2200211001101120 is an apocalyptic number.
200211001101120 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
200211001101120 is an abundant number, since it is smaller than the sum of its proper divisors (444166734860160).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
200211001101120 is a wasteful number, since it uses less digits than its factorization.
200211001101120 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2856892232 (or 2856892222 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 200211001101120 its reverse (21101100112002), we get a palindrome (221312101213122).
The spelling of 200211001101120 in words is "two hundred trillion, two hundred eleven billion, one million, one hundred one thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •