Base | Representation |
---|---|
bin | 1100111000000010101… |
… | …1011110000100101111 |
3 | 210010221221222121100220 |
4 | 3032000223132010233 |
5 | 12111010231223434 |
6 | 245341403022423 |
7 | 21660411525411 |
oct | 3160053360457 |
9 | 703857877326 |
10 | 221202211119 |
11 | 858a197722a |
12 | 36a5420aa13 |
13 | 17b22ab3826 |
14 | a9c5d109b1 |
15 | 5b49a15d49 |
hex | 3380ade12f |
221202211119 has 8 divisors (see below), whose sum is σ = 295884630912. Its totient is φ = 146993966040.
The previous prime is 221202211099. The next prime is 221202211147. The reversal of 221202211119 is 911112202122.
221202211119 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 221202211119 - 220 = 221201162543 is a prime.
It is a super-2 number, since 2×2212022111192 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (221202211319) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 118542589 + ... + 118544454.
It is an arithmetic number, because the mean of its divisors is an integer number (36985578864).
Almost surely, 2221202211119 is an apocalyptic number.
221202211119 is a deficient number, since it is larger than the sum of its proper divisors (74682419793).
221202211119 is a wasteful number, since it uses less digits than its factorization.
221202211119 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 237087357.
The product of its (nonzero) digits is 288, while the sum is 24.
The spelling of 221202211119 in words is "two hundred twenty-one billion, two hundred two million, two hundred eleven thousand, one hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •