Base | Representation |
---|---|
bin | 110010010001011101010010… |
… | …001110101011011000100011 |
3 | 1001222212010220121102011221012 |
4 | 302101131102032223120203 |
5 | 212440013344224311321 |
6 | 2102124505041451135 |
7 | 64400043462354116 |
oct | 6221352216533043 |
9 | 1058763817364835 |
10 | 221102001010211 |
11 | 644a49174a8a22 |
12 | 2096b070940aab |
13 | 964aaa1a89c99 |
14 | 3c85572dc857d |
15 | 1a865853d805b |
hex | c917523ab623 |
221102001010211 has 8 divisors (see below), whose sum is σ = 222348398502048. Its totient is φ = 219855876480000.
The previous prime is 221102001010207. The next prime is 221102001010217. The reversal of 221102001010211 is 112010100201122.
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 221102001010211 - 22 = 221102001010207 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (221102001010217) 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, 66615710 + ... + 69855971.
It is an arithmetic number, because the mean of its divisors is an integer number (27793549812756).
Almost surely, 2221102001010211 is an apocalyptic number.
221102001010211 is a deficient number, since it is larger than the sum of its proper divisors (1246397491837).
221102001010211 is a wasteful number, since it uses less digits than its factorization.
221102001010211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 136480813.
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 221102001010211 its reverse (112010100201122), we get a palindrome (333112101211333).
The spelling of 221102001010211 in words is "two hundred twenty-one trillion, one hundred two billion, one million, ten thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •