Base | Representation |
---|---|
bin | 1011101101001110101… |
… | …1111111101001101110 |
3 | 201020010101210122121110 |
4 | 2323103223333221232 |
5 | 11243343211133402 |
6 | 232220540012450 |
7 | 20346640654440 |
oct | 2732353775156 |
9 | 636111718543 |
10 | 201120021102 |
11 | 78327010680 |
12 | 32b8a831126 |
13 | 15c7238ca60 |
14 | 9a3cb52490 |
15 | 537196256c |
hex | 2ed3affa6e |
201120021102 has 256 divisors, whose sum is σ = 560954419200. Its totient is φ = 46385602560.
The previous prime is 201120021101. The next prime is 201120021121.
201120021102 is nontrivially palindromic in base 10.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (201120021101) by changing a digit.
It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 19772674 + ... + 19782842.
It is an arithmetic number, because the mean of its divisors is an integer number (2191228200).
Almost surely, 2201120021102 is an apocalyptic number.
201120021102 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 201120021102, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (280477209600).
201120021102 is an abundant number, since it is smaller than the sum of its proper divisors (359834398098).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
201120021102 is a wasteful number, since it uses less digits than its factorization.
201120021102 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10331.
The product of its (nonzero) digits is 16, while the sum is 12.
It can be divided in two parts, 2011200 and 21102, that added together give a palindrome (2032302).
The spelling of 201120021102 in words is "two hundred one billion, one hundred twenty million, twenty-one thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •