Base | Representation |
---|---|
bin | 1100111000000111001… |
… | …1001011101100100011 |
3 | 210011000021100200212120 |
4 | 3032001303023230203 |
5 | 12111030034311321 |
6 | 245343313555323 |
7 | 21661030363305 |
oct | 3160163135443 |
9 | 704007320776 |
10 | 221221010211 |
11 | 85901547273 |
12 | 36a5a575b43 |
13 | 17b26966456 |
14 | a9c8605975 |
15 | 5b4b4caec6 |
hex | 3381ccbb23 |
221221010211 has 4 divisors (see below), whose sum is σ = 294961346952. Its totient is φ = 147480673472.
The previous prime is 221221010203. The next prime is 221221010299. The reversal of 221221010211 is 112010122122.
221221010211 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 221221010211 - 23 = 221221010203 is a prime.
It is not an unprimeable number, because it can be changed into a prime (221221010011) 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 3 ways as a sum of consecutive naturals, for example, 36870168366 + ... + 36870168371.
It is an arithmetic number, because the mean of its divisors is an integer number (73740336738).
Almost surely, 2221221010211 is an apocalyptic number.
221221010211 is a deficient number, since it is larger than the sum of its proper divisors (73740336741).
221221010211 is an equidigital number, since it uses as much as digits as its factorization.
221221010211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 73740336740.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 221221010211 its reverse (112010122122), we get a palindrome (333231132333).
The spelling of 221221010211 in words is "two hundred twenty-one billion, two hundred twenty-one million, ten thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •