Base | Representation |
---|---|
bin | 1011101001111000011… |
… | …0111011001011011000 |
3 | 201010210202100021202201 |
4 | 2322132012323023120 |
5 | 11240023101023000 |
6 | 231551425135544 |
7 | 20315444235331 |
oct | 2723606731330 |
9 | 633722307681 |
10 | 200221111000 |
11 | 77a05663169 |
12 | 3297978a5b4 |
13 | 15b5b0884a1 |
14 | 99955db288 |
15 | 531ca9d96a |
hex | 2e9e1bb2d8 |
200221111000 has 64 divisors (see below), whose sum is σ = 470299452480. Its totient is φ = 79783820800.
The previous prime is 200221110979. The next prime is 200221111003. The reversal of 200221111000 is 111122002.
It is a super-4 number, since 4×2002211110004 (a number of 46 digits) contains 4444 as substring.
It is a Harshad number since it is a multiple of its sum of digits (10).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (200221111003) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 117649 + ... + 643648.
It is an arithmetic number, because the mean of its divisors is an integer number (7348428945).
Almost surely, 2200221111000 is an apocalyptic number.
200221111000 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
200221111000 is an abundant number, since it is smaller than the sum of its proper divisors (270078341480).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
200221111000 is a wasteful number, since it uses less digits than its factorization.
200221111000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 761581 (or 761567 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 10.
Adding to 200221111000 its reverse (111122002), we get a palindrome (200332233002).
The spelling of 200221111000 in words is "two hundred billion, two hundred twenty-one million, one hundred eleven thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.033 sec. • engine limits •