Base | Representation |
---|---|
bin | 1010000011100001001000… |
… | …10101010010111010110100 |
3 | 2220021210121122211012021212 |
4 | 11001300210111102322310 |
5 | 10344232013401431400 |
6 | 115005411043300552 |
7 | 4441321462121111 |
oct | 501604425227264 |
9 | 86253548735255 |
10 | 22111101202100 |
11 | 70552a1214409 |
12 | 259134307a758 |
13 | c450b6226b81 |
14 | 56627c263908 |
15 | 28526197d335 |
hex | 141c24552eb4 |
22111101202100 has 36 divisors (see below), whose sum is σ = 49528866699648. Its totient is φ = 8559135948000.
The previous prime is 22111101202033. The next prime is 22111101202123. The reversal of 22111101202100 is 120210111122.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 3566303546 + ... + 3566309745.
It is an arithmetic number, because the mean of its divisors is an integer number (1375801852768).
Almost surely, 222111101202100 is an apocalyptic number.
22111101202100 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
22111101202100 is an abundant number, since it is smaller than the sum of its proper divisors (27417765497548).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
22111101202100 is a wasteful number, since it uses less digits than its factorization.
22111101202100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7132613336 (or 7132613329 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 22111101202100 its reverse (120210111122), we get a palindrome (22231311313222).
The spelling of 22111101202100 in words is "twenty-two trillion, one hundred eleven billion, one hundred one million, two hundred two thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •