Base | Representation |
---|---|
bin | 11110100011111101101… |
… | …111011011111001000111 |
3 | 21102202222121220200210110 |
4 | 132203331233123321013 |
5 | 233402202441023421 |
6 | 4244452530324103 |
7 | 304506640616235 |
oct | 36437557337107 |
9 | 7382877820713 |
10 | 2100201111111 |
11 | 73a765858714 |
12 | 29b049129633 |
13 | 123081929a6c |
14 | 73916501955 |
15 | 3996ebe0a76 |
hex | 1e8fdbdbe47 |
2100201111111 has 8 divisors (see below), whose sum is σ = 2800350724864. Its totient is φ = 1400092785720.
The previous prime is 2100201111083. The next prime is 2100201111119. The reversal of 2100201111111 is 1111111020012.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 2100201111111 - 214 = 2100201094727 is a prime.
It is a super-2 number, since 2×21002011111112 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
2100201111111 is a modest number, since divided by 1111111 gives 210020 as remainder.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2100201111119) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 10203205 + ... + 10407006.
It is an arithmetic number, because the mean of its divisors is an integer number (350043840608).
Almost surely, 22100201111111 is an apocalyptic number.
2100201111111 is a deficient number, since it is larger than the sum of its proper divisors (700149613753).
2100201111111 is a wasteful number, since it uses less digits than its factorization.
2100201111111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 20644181.
The product of its (nonzero) digits is 4, while the sum is 12.
Adding to 2100201111111 its reverse (1111111020012), we get a palindrome (3211312131123).
The spelling of 2100201111111 in words is "two trillion, one hundred billion, two hundred one million, one hundred eleven thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •