Base | Representation |
---|---|
bin | 1100111000000100110… |
… | …1110000101011001001 |
3 | 210010222120220022001212 |
4 | 3032001031300223021 |
5 | 12111020031401301 |
6 | 245342323422505 |
7 | 21660551114555 |
oct | 3160115605311 |
9 | 703876808055 |
10 | 221211200201 |
11 | 858a6a56922 |
12 | 36a57224a35 |
13 | 17b24910204 |
14 | a9c71b0865 |
15 | 5b4a6de4bb |
hex | 3381370ac9 |
221211200201 has 4 divisors (see below), whose sum is σ = 221212749252. Its totient is φ = 221209651152.
The previous prime is 221211200179. The next prime is 221211200213. The reversal of 221211200201 is 102002112122.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 171995996176 + 49215204025 = 414724^2 + 221845^2 .
It is a cyclic number.
It is not a de Polignac number, because 221211200201 - 230 = 220137458377 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (221211200291) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 535790 + ... + 854103.
It is an arithmetic number, because the mean of its divisors is an integer number (55303187313).
Almost surely, 2221211200201 is an apocalyptic number.
It is an amenable number.
221211200201 is a deficient number, since it is larger than the sum of its proper divisors (1549051).
221211200201 is a wasteful number, since it uses less digits than its factorization.
221211200201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1549050.
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 221211200201 its reverse (102002112122), we get a palindrome (323213312323).
The spelling of 221211200201 in words is "two hundred twenty-one billion, two hundred eleven million, two hundred thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •