Base | Representation |
---|---|
bin | 1011101101001010011… |
… | …1101000111000000101 |
3 | 201020002011002021020210 |
4 | 2323102213220320011 |
5 | 11243324114231041 |
6 | 232215055550033 |
7 | 20346332443302 |
oct | 2732247507005 |
9 | 636064067223 |
10 | 201102102021 |
11 | 78317991817 |
12 | 32b8482b319 |
13 | 15c6b757852 |
14 | 9a3a60a0a9 |
15 | 53700c3016 |
hex | 2ed29e8e05 |
201102102021 has 64 divisors (see below), whose sum is σ = 302883598080. Its totient is φ = 117936230400.
The previous prime is 201102101951. The next prime is 201102102067. The reversal of 201102102021 is 120201201102.
201102102021 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 201102102021 - 214 = 201102085637 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 201102101988 and 201102102006.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (201102102121) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 28672111 + ... + 28679123.
It is an arithmetic number, because the mean of its divisors is an integer number (4732556220).
Almost surely, 2201102102021 is an apocalyptic number.
It is an amenable number.
201102102021 is a deficient number, since it is larger than the sum of its proper divisors (101781496059).
201102102021 is a wasteful number, since it uses less digits than its factorization.
201102102021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7446.
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 201102102021 its reverse (120201201102), we get a palindrome (321303303123).
The spelling of 201102102021 in words is "two hundred one billion, one hundred two million, one hundred two thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •