Base | Representation |
---|---|
bin | 1011101101001100100… |
… | …1111101101011000100 |
3 | 201020002210000102021222 |
4 | 2323103021331223010 |
5 | 11243333420200400 |
6 | 232220020455512 |
7 | 20346502100621 |
oct | 2732311755304 |
9 | 636083012258 |
10 | 201111100100 |
11 | 78321a78149 |
12 | 32b8784a598 |
13 | 15c70588361 |
14 | 9a3b8ad348 |
15 | 5370c9e185 |
hex | 2ed327dac4 |
201111100100 has 18 divisors (see below), whose sum is σ = 436411087434. Its totient is φ = 80444440000.
The previous prime is 201111100081. The next prime is 201111100129. The reversal of 201111100100 is 1001111102.
It is a happy number.
It can be written as a sum of positive squares in 3 ways, for example, as 261921856 + 200849178244 = 16184^2 + 448162^2 .
It is an unprimeable number.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 1005555401 + ... + 1005555600.
It is an arithmetic number, because the mean of its divisors is an integer number (24245060413).
Almost surely, 2201111100100 is an apocalyptic number.
201111100100 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
201111100100 is an abundant number, since it is smaller than the sum of its proper divisors (235299987334).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
201111100100 is a wasteful number, since it uses less digits than its factorization.
201111100100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2011111015 (or 2011111008 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 8.
Adding to 201111100100 its reverse (1001111102), we get a palindrome (202112211202).
It can be divided in two parts, 20111 and 1100100, that added together give a palindrome (1120211).
The spelling of 201111100100 in words is "two hundred one billion, one hundred eleven million, one hundred thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •