Base | Representation |
---|---|
bin | 101101101111110110010011… |
… | …101001110101110010101111 |
3 | 222101101112221021200111022112 |
4 | 231233312103221311302233 |
5 | 202332431022332400421 |
6 | 1551530034413434235 |
7 | 60244144006556426 |
oct | 5557662351656257 |
9 | 871345837614275 |
10 | 201200220200111 |
11 | 5912159702a000 |
12 | 1a695b4a79b97b |
13 | 883613a3843c2 |
14 | 37981dd4ac2bd |
15 | 183da2d27445b |
hex | b6fd93a75caf |
201200220200111 has 16 divisors (see below), whose sum is σ = 221354234884608. Its totient is φ = 182868702259320.
The previous prime is 201200220200027. The next prime is 201200220200173. The reversal of 201200220200111 is 111002022002102.
It is a de Polignac number, because none of the positive numbers 2k-201200220200111 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (201200220200191) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 10771175 + ... + 22768808.
It is an arithmetic number, because the mean of its divisors is an integer number (13834639680288).
Almost surely, 2201200220200111 is an apocalyptic number.
201200220200111 is a deficient number, since it is larger than the sum of its proper divisors (20154014684497).
201200220200111 is an equidigital number, since it uses as much as digits as its factorization.
201200220200111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 33544523 (or 33544501 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 201200220200111 its reverse (111002022002102), we get a palindrome (312202242202213).
The spelling of 201200220200111 in words is "two hundred one trillion, two hundred billion, two hundred twenty million, two hundred thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •