Base | Representation |
---|---|
bin | 1100110100010100010… |
… | …0101111000000100001 |
3 | 210001101021021211112120 |
4 | 3031011010233000201 |
5 | 12101433230413441 |
6 | 245054241214453 |
7 | 21623546553360 |
oct | 3150504570041 |
9 | 701337254476 |
10 | 220202201121 |
11 | 85429446991 |
12 | 36815331429 |
13 | 179c3871c36 |
14 | a92d19d7d7 |
15 | 5adbd31966 |
hex | 334512f021 |
220202201121 has 16 divisors (see below), whose sum is σ = 347116771200. Its totient is φ = 121490869248.
The previous prime is 220202201111. The next prime is 220202201129. The reversal of 220202201121 is 121102202022.
It is not a de Polignac number, because 220202201121 - 26 = 220202201057 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 220202201121.
It is not an unprimeable number, because it can be changed into a prime (220202201129) 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, 180789376 + ... + 180790593.
It is an arithmetic number, because the mean of its divisors is an integer number (21694798200).
Almost surely, 2220202201121 is an apocalyptic number.
220202201121 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
It is an amenable number.
220202201121 is a deficient number, since it is larger than the sum of its proper divisors (126914570079).
220202201121 is a wasteful number, since it uses less digits than its factorization.
220202201121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 361580008.
The product of its (nonzero) digits is 64, while the sum is 15.
Adding to 220202201121 its reverse (121102202022), we get a palindrome (341304403143).
Subtracting from 220202201121 its reverse (121102202022), we obtain a palindrome (99099999099).
The spelling of 220202201121 in words is "two hundred twenty billion, two hundred two million, two hundred one thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •