Base | Representation |
---|---|
bin | 101101101101001110100100… |
… | …001111111111101011011110 |
3 | 222100202100001002120220011110 |
4 | 231231032210033333223132 |
5 | 202322003141130323402 |
6 | 1551311210315202450 |
7 | 60225136502326524 |
oct | 5555164417775336 |
9 | 870670032526143 |
10 | 201020110011102 |
11 | 59062171577228 |
12 | 1a667064146426 |
13 | 882216596c775 |
14 | 378d5d4bcc314 |
15 | 1838edb05256c |
hex | b6d3a43ffade |
201020110011102 has 64 divisors (see below), whose sum is σ = 435074030714880. Its totient is φ = 61702406626176.
The previous prime is 201020110011101. The next prime is 201020110011199. The reversal of 201020110011102 is 201110011020102.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (201020110011101) 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 31 ways as a sum of consecutive naturals, for example, 19695198 + ... + 28105889.
It is an arithmetic number, because the mean of its divisors is an integer number (6798031729920).
Almost surely, 2201020110011102 is an apocalyptic number.
201020110011102 is an abundant number, since it is smaller than the sum of its proper divisors (234053920703778).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
201020110011102 is a wasteful number, since it uses less digits than its factorization.
201020110011102 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 47802145.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 201020110011102 its reverse (201110011020102), we get a palindrome (402130121031204).
The spelling of 201020110011102 in words is "two hundred one trillion, twenty billion, one hundred ten million, eleven thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •