Base | Representation |
---|---|
bin | 110010010011001011010001… |
… | …100011001110011100011001 |
3 | 1002000021102202012210110100201 |
4 | 302103023101203032130121 |
5 | 212443432231403020441 |
6 | 2102255040031102201 |
7 | 64411424222522653 |
oct | 6223132143163431 |
9 | 1060242665713321 |
10 | 221220101220121 |
11 | 6453aa10a40693 |
12 | 20989b30371961 |
13 | 9658c734b51b3 |
14 | 3c8b177cbd6d3 |
15 | 1a896986c2c31 |
hex | c932d18ce719 |
221220101220121 has 16 divisors (see below), whose sum is σ = 235816115008320. Its totient is φ = 207232343297280.
The previous prime is 221220101220067. The next prime is 221220101220169. The reversal of 221220101220121 is 121022101022122.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-221220101220121 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (221220101280121) 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, 1063280340 + ... + 1063488373.
It is an arithmetic number, because the mean of its divisors is an integer number (14738507188020).
Almost surely, 2221220101220121 is an apocalyptic number.
It is an amenable number.
221220101220121 is a deficient number, since it is larger than the sum of its proper divisors (14596013788199).
221220101220121 is a wasteful number, since it uses less digits than its factorization.
221220101220121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2126768856.
The product of its (nonzero) digits is 128, while the sum is 19.
Adding to 221220101220121 its reverse (121022101022122), we get a palindrome (342242202242243).
The spelling of 221220101220121 in words is "two hundred twenty-one trillion, two hundred twenty billion, one hundred one million, two hundred twenty thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •