Base | Representation |
---|---|
bin | 101110101010001100… |
… | …1100000010111001111 |
3 | 100120122010101120121101 |
4 | 1131110121200113033 |
5 | 3120202224020421 |
6 | 114010434243531 |
7 | 10145024550415 |
oct | 1352431402717 |
9 | 316563346541 |
10 | 100200220111 |
11 | 39549459472 |
12 | 17504a265a7 |
13 | 95ab142c94 |
14 | 4bc789d2b5 |
15 | 2916ad9191 |
hex | 17546605cf |
100200220111 has 8 divisors (see below), whose sum is σ = 102546336464. Its totient is φ = 97854825600.
The previous prime is 100200220103. The next prime is 100200220117. The reversal of 100200220111 is 111022002001.
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 100200220111 - 23 = 100200220103 is a prime.
It is a super-2 number, since 2×1002002201112 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100200220117) 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 7 ways as a sum of consecutive naturals, for example, 105661 + ... + 459961.
It is an arithmetic number, because the mean of its divisors is an integer number (12818292058).
Almost surely, 2100200220111 is an apocalyptic number.
100200220111 is a deficient number, since it is larger than the sum of its proper divisors (2346116353).
100200220111 is an equidigital number, since it uses as much as digits as its factorization.
100200220111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 360921.
The product of its (nonzero) digits is 8, while the sum is 10.
Adding to 100200220111 its reverse (111022002001), we get a palindrome (211222222112).
The spelling of 100200220111 in words is "one hundred billion, two hundred million, two hundred twenty thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •