Base | Representation |
---|---|
bin | 101101110000001000111011… |
… | …110011001101111111101011 |
3 | 222101110110120011220110222220 |
4 | 231300020323303031333223 |
5 | 202333243003100200021 |
6 | 1551543143214245123 |
7 | 60245452442452101 |
oct | 5560107363157753 |
9 | 871413504813886 |
10 | 201220221100011 |
11 | 5912a020013143 |
12 | 1a6999b0ab67a3 |
13 | 8837ca6cb5809 |
14 | 3799179949c71 |
15 | 183e2ee11bcc6 |
hex | b7023bccdfeb |
201220221100011 has 4 divisors (see below), whose sum is σ = 268293628133352. Its totient is φ = 134146814066672.
The previous prime is 201220221100009. The next prime is 201220221100127. The reversal of 201220221100011 is 110001122022102.
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 201220221100011 - 21 = 201220221100009 is a prime.
It is not an unprimeable number, because it can be changed into a prime (201220221100411) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 33536703516666 + ... + 33536703516671.
It is an arithmetic number, because the mean of its divisors is an integer number (67073407033338).
Almost surely, 2201220221100011 is an apocalyptic number.
201220221100011 is a deficient number, since it is larger than the sum of its proper divisors (67073407033341).
201220221100011 is an equidigital number, since it uses as much as digits as its factorization.
201220221100011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 67073407033340.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 201220221100011 its reverse (110001122022102), we get a palindrome (311221343122113).
The spelling of 201220221100011 in words is "two hundred one trillion, two hundred twenty billion, two hundred twenty-one million, one hundred thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •