Base | Representation |
---|---|
bin | 1100110111010010110… |
… | …0010011001101111000 |
3 | 210010102221120012210102 |
4 | 3031310230103031320 |
5 | 12110102240232300 |
6 | 245305420334532 |
7 | 21652420242134 |
oct | 3156454231570 |
9 | 703387505712 |
10 | 221001102200 |
11 | 857a93a710a |
12 | 369b89a4448 |
13 | 17ac022b878 |
14 | a9a73203c4 |
15 | 5b3703d0d5 |
hex | 3374b13378 |
221001102200 has 48 divisors (see below), whose sum is σ = 513859979160. Its totient is φ = 88394864000.
The previous prime is 221001102199. The next prime is 221001102209. The reversal of 221001102200 is 2201100122.
It is a happy number.
221001102200 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×2210011022002 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (221001102209) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 4851530 + ... + 4896870.
Almost surely, 2221001102200 is an apocalyptic number.
221001102200 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
221001102200 is an abundant number, since it is smaller than the sum of its proper divisors (292858876960).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
221001102200 is a wasteful number, since it uses less digits than its factorization.
221001102200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 69728 (or 69719 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 11.
Adding to 221001102200 its reverse (2201100122), we get a palindrome (223202202322).
The spelling of 221001102200 in words is "two hundred twenty-one billion, one million, one hundred two thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •