Base | Representation |
---|---|
bin | 100000001011001011001… |
… | …000001011101110111000 |
3 | 21211101000212021221110011 |
4 | 200023023020023232320 |
5 | 242211132401011300 |
6 | 4411421251431304 |
7 | 315512110226500 |
oct | 40131310135670 |
9 | 7741025257404 |
10 | 2211021110200 |
11 | 782763859221 |
12 | 2b86165b5534 |
13 | 130662c8c716 |
14 | 7902a578a00 |
15 | 3c7a8cb0eba |
hex | 202cb20bbb8 |
2211021110200 has 72 divisors (see below), whose sum is σ = 5979909672000. Its totient is φ = 758064377280.
The previous prime is 2211021110183. The next prime is 2211021110201. The reversal of 2211021110200 is 20111201122.
It is a super-2 number, since 2×22110211102002 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2211021110201) by changing a digit.
It is a polite number, since it can be written in 17 ways as a sum of consecutive naturals, for example, 112797400 + ... + 112816999.
It is an arithmetic number, because the mean of its divisors is an integer number (83054301000).
Almost surely, 22211021110200 is an apocalyptic number.
2211021110200 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
2211021110200 is an abundant number, since it is smaller than the sum of its proper divisors (3768888561800).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2211021110200 is a wasteful number, since it uses less digits than its factorization.
2211021110200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 225614429 (or 225614413 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 2211021110200 its reverse (20111201122), we get a palindrome (2231132311322).
The spelling of 2211021110200 in words is "two trillion, two hundred eleven billion, twenty-one million, one hundred ten thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.126 sec. • engine limits •