Base | Representation |
---|---|
bin | 101110101010110010… |
… | …1000000001011001101 |
3 | 100120200111122001220011 |
4 | 1131111211000023031 |
5 | 3120222310324323 |
6 | 114012422353221 |
7 | 10145355016420 |
oct | 1352545001315 |
9 | 316614561804 |
10 | 100220011213 |
11 | 39559646853 |
12 | 1750b58b811 |
13 | 95b22822aa |
14 | 4bca3719b7 |
15 | 29186e820d |
hex | 17559402cd |
100220011213 has 8 divisors (see below), whose sum is σ = 114575757120. Its totient is φ = 85873915680.
The previous prime is 100220011211. The next prime is 100220011247. The reversal of 100220011213 is 312110022001.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 100220011213 - 21 = 100220011211 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 100220011193 and 100220011202.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100220011211) 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 7 ways as a sum of consecutive naturals, for example, 2390323 + ... + 2431888.
It is an arithmetic number, because the mean of its divisors is an integer number (14321969640).
Almost surely, 2100220011213 is an apocalyptic number.
It is an amenable number.
100220011213 is a deficient number, since it is larger than the sum of its proper divisors (14355745907).
100220011213 is an equidigital number, since it uses as much as digits as its factorization.
100220011213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4825187.
The product of its (nonzero) digits is 24, while the sum is 13.
Adding to 100220011213 its reverse (312110022001), we get a palindrome (412330033214).
The spelling of 100220011213 in words is "one hundred billion, two hundred twenty million, eleven thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •