Base | Representation |
---|---|
bin | 1011101101001010000… |
… | …0011011001101000010 |
3 | 201020002000112012021100 |
4 | 2323102200123031002 |
5 | 11243323123223020 |
6 | 232214551235230 |
7 | 20346310406166 |
oct | 2732240331502 |
9 | 636060465240 |
10 | 201100211010 |
11 | 7831690aaa6 |
12 | 32b84078b16 |
13 | 15c6b244bca |
14 | 9a3a276ca6 |
15 | 536ed4ca90 |
hex | 2ed281b342 |
201100211010 has 24 divisors (see below), whose sum is σ = 522860548860. Its totient is φ = 53626722912.
The previous prime is 201100210981. The next prime is 201100211017. The reversal of 201100211010 is 10112001102.
It is a happy number.
It can be written as a sum of positive squares in 2 ways, for example, as 200912822289 + 187388721 = 448233^2 + 13689^2 .
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a junction number, because it is equal to n+sod(n) for n = 201100210983 and 201100211001.
It is not an unprimeable number, because it can be changed into a prime (201100211017) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 1117223305 + ... + 1117223484.
Almost surely, 2201100211010 is an apocalyptic number.
201100211010 is an abundant number, since it is smaller than the sum of its proper divisors (321760337850).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
201100211010 is a wasteful number, since it uses less digits than its factorization.
201100211010 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2234446802 (or 2234446799 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 201100211010 its reverse (10112001102), we get a palindrome (211212212112).
The spelling of 201100211010 in words is "two hundred one billion, one hundred million, two hundred eleven thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •