Base | Representation |
---|---|
bin | 11110100011111101101… |
… | …100000010010101101011 |
3 | 21102202222120020102102202 |
4 | 132203331230002111223 |
5 | 233402202224020021 |
6 | 4244452455250415 |
7 | 304506630215255 |
oct | 36437554022553 |
9 | 7382876212382 |
10 | 2100200220011 |
11 | 73a7652aa173 |
12 | 29b048979a0b |
13 | 1230816a729a |
14 | 7391634ccd5 |
15 | 3996eab6a0b |
hex | 1e8fdb0256b |
2100200220011 has 8 divisors (see below), whose sum is σ = 2102366975280. Its totient is φ = 2098033725312.
The previous prime is 2100200220007. The next prime is 2100200220029. The reversal of 2100200220011 is 1100220020012.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 2100200220011 - 22 = 2100200220007 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2100200219974 and 2100200220001.
It is not an unprimeable number, because it can be changed into a prime (2100200220061) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 18878396 + ... + 18989318.
It is an arithmetic number, because the mean of its divisors is an integer number (262795871910).
Almost surely, 22100200220011 is an apocalyptic number.
2100200220011 is a deficient number, since it is larger than the sum of its proper divisors (2166755269).
2100200220011 is a wasteful number, since it uses less digits than its factorization.
2100200220011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 130285.
The product of its (nonzero) digits is 16, while the sum is 11.
Adding to 2100200220011 its reverse (1100220020012), we get a palindrome (3200420240023).
The spelling of 2100200220011 in words is "two trillion, one hundred billion, two hundred million, two hundred twenty thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •