Base | Representation |
---|---|
bin | 110010010010111000100100… |
… | …000101100000001110111110 |
3 | 1002000012111220002200200002010 |
4 | 302102320210011200032332 |
5 | 212443120110320213433 |
6 | 2102241514322112050 |
7 | 64410113324366310 |
oct | 6222704405401676 |
9 | 1060174802620063 |
10 | 221200011101118 |
11 | 64532441659955 |
12 | 209860641ab626 |
13 | 96570c124640a |
14 | 3c8a1cda597b0 |
15 | 1a88dbeaa4e63 |
hex | c92e241603be |
221200011101118 has 32 divisors (see below), whose sum is σ = 505988649653760. Its totient is φ = 63151425136800.
The previous prime is 221200011101117. The next prime is 221200011101141. The reversal of 221200011101118 is 811101110002122.
It is a super-2 number, since 2×2212000111011182 (a number of 29 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a junction number, because it is equal to n+sod(n) for n = 221200011101094 and 221200011101103.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (221200011101117) 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, 2024029498 + ... + 2024138781.
It is an arithmetic number, because the mean of its divisors is an integer number (15812145301680).
Almost surely, 2221200011101118 is an apocalyptic number.
221200011101118 is an abundant number, since it is smaller than the sum of its proper divisors (284788638552642).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
221200011101118 is a wasteful number, since it uses less digits than its factorization.
221200011101118 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4048169592.
The product of its (nonzero) digits is 64, while the sum is 21.
The spelling of 221200011101118 in words is "two hundred twenty-one trillion, two hundred billion, eleven million, one hundred one thousand, one hundred eighteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •