Base | Representation |
---|---|
bin | 101101110000001000101111… |
… | …111011101110000110111111 |
3 | 222101110110001022021021000121 |
4 | 231300020233323232012333 |
5 | 202333242101113031421 |
6 | 1551543111343035411 |
7 | 60245444504242540 |
oct | 5560105773560677 |
9 | 871413038237017 |
10 | 201220022002111 |
11 | 59129a28696a22 |
12 | 1a69995629bb67 |
13 | 8837c74985cc8 |
14 | 379915b3204c7 |
15 | 183e2db8ded41 |
hex | b7022feee1bf |
201220022002111 has 16 divisors (see below), whose sum is σ = 237397226526720. Its totient is φ = 166901309756640.
The previous prime is 201220022002081. The next prime is 201220022002159. The reversal of 201220022002111 is 111200220022102.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 201220022002111 - 27 = 201220022001983 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 (201220022002511) 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 15 ways as a sum of consecutive naturals, for example, 21952636 + ... + 29738161.
It is an arithmetic number, because the mean of its divisors is an integer number (14837326657920).
Almost surely, 2201220022002111 is an apocalyptic number.
201220022002111 is a deficient number, since it is larger than the sum of its proper divisors (36177204524609).
201220022002111 is a wasteful number, since it uses less digits than its factorization.
201220022002111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 51708774.
The product of its (nonzero) digits is 64, while the sum is 16.
Adding to 201220022002111 its reverse (111200220022102), we get a palindrome (312420242024213).
The spelling of 201220022002111 in words is "two hundred one trillion, two hundred twenty billion, twenty-two million, two thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •