Base | Representation |
---|---|
bin | 110010010001011100100010… |
… | …100011101110000110110101 |
3 | 1001222212001211212110122001022 |
4 | 302101130202203232012311 |
5 | 212440010230003020041 |
6 | 2102124253431310525 |
7 | 64400014611303233 |
oct | 6221344243560665 |
9 | 1058761755418038 |
10 | 221101201220021 |
11 | 644a4546aa07a1 |
12 | 2096aa88b1b445 |
13 | 964a9a517b755 |
14 | 3c854d8ab5953 |
15 | 1a8653a0a324b |
hex | c917228ee1b5 |
221101201220021 has 16 divisors (see below), whose sum is σ = 222731506771200. Its totient is φ = 219472865948160.
The previous prime is 221101201220017. The next prime is 221101201220033. The reversal of 221101201220021 is 120022102101122.
It is a cyclic number.
It is not a de Polignac number, because 221101201220021 - 22 = 221101201220017 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (221101201220051) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 6414104816 + ... + 6414139286.
It is an arithmetic number, because the mean of its divisors is an integer number (13920719173200).
Almost surely, 2221101201220021 is an apocalyptic number.
It is an amenable number.
221101201220021 is a deficient number, since it is larger than the sum of its proper divisors (1630305551179).
221101201220021 is a wasteful number, since it uses less digits than its factorization.
221101201220021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 61684.
The product of its (nonzero) digits is 64, while the sum is 17.
Adding to 221101201220021 its reverse (120022102101122), we get a palindrome (341123303321143).
The spelling of 221101201220021 in words is "two hundred twenty-one trillion, one hundred one billion, two hundred one million, two hundred twenty thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •