Base | Representation |
---|---|
bin | 1100110111101111000… |
… | …1110111010011000101 |
3 | 210010202020021220120212 |
4 | 3031323301313103011 |
5 | 12110323210014341 |
6 | 245325305005205 |
7 | 21655362666410 |
oct | 3157361672305 |
9 | 703666256525 |
10 | 221120001221 |
11 | 8585a526769 |
12 | 36a30783805 |
13 | 17b0ba5b612 |
14 | a9b9030b77 |
15 | 5b426c75eb |
hex | 337bc774c5 |
221120001221 has 8 divisors (see below), whose sum is σ = 252723481920. Its totient is φ = 189520247808.
The previous prime is 221120001211. The next prime is 221120001331. The reversal of 221120001221 is 122100021122.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 221120001221 - 214 = 221119984837 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 221120001196 and 221120001205.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (221120001211) 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 7 ways as a sum of consecutive naturals, for example, 803516 + ... + 1043013.
It is an arithmetic number, because the mean of its divisors is an integer number (31590435240).
Almost surely, 2221120001221 is an apocalyptic number.
It is an amenable number.
221120001221 is a deficient number, since it is larger than the sum of its proper divisors (31603480699).
221120001221 is a wasteful number, since it uses less digits than its factorization.
221120001221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1863643.
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 221120001221 its reverse (122100021122), we get a palindrome (343220022343).
The spelling of 221120001221 in words is "two hundred twenty-one billion, one hundred twenty million, one thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 1.003 sec. • engine limits •