Base | Representation |
---|---|
bin | 110010010000010000111011… |
… | …111010000010011010001000 |
3 | 1001222120022022100200011210201 |
4 | 302100100323322002122020 |
5 | 212432143001130401440 |
6 | 2102023110233421544 |
7 | 64361112121330354 |
oct | 6220207372023210 |
9 | 1058508270604721 |
10 | 221020022122120 |
11 | 64473079564a41 |
12 | 209571b226a8b4 |
13 | 9643138990390 |
14 | 3c815d74cc464 |
15 | 1a8438832719a |
hex | c9043be82688 |
221020022122120 has 128 divisors (see below), whose sum is σ = 544808842905600. Its totient is φ = 80207276599296.
The previous prime is 221020022122103. The next prime is 221020022122169. The reversal of 221020022122120 is 21221220020122.
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 31 ways as a sum of consecutive naturals, for example, 6569784 + ... + 22027303.
It is an arithmetic number, because the mean of its divisors is an integer number (4256319085200).
Almost surely, 2221020022122120 is an apocalyptic number.
221020022122120 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
221020022122120 is an abundant number, since it is smaller than the sum of its proper divisors (323788820783480).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
221020022122120 is a wasteful number, since it uses less digits than its factorization.
221020022122120 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 28597367 (or 28597363 counting only the distinct ones).
The product of its (nonzero) digits is 256, while the sum is 19.
Adding to 221020022122120 its reverse (21221220020122), we get a palindrome (242241242142242).
The spelling of 221020022122120 in words is "two hundred twenty-one trillion, twenty billion, twenty-two million, one hundred twenty-two thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •