Base | Representation |
---|---|
bin | 1100110011111011111… |
… | …1010010011110000101 |
3 | 210001010011012002010211 |
4 | 3030332333102132011 |
5 | 12101231112011323 |
6 | 245040153115421 |
7 | 21621200032264 |
oct | 3147677223605 |
9 | 701104162124 |
10 | 220100110213 |
11 | 85386857535 |
12 | 367a70b8b71 |
13 | 179a8678809 |
14 | a91d7c65db |
15 | 5ad2db770d |
hex | 333efd2785 |
220100110213 has 8 divisors (see below), whose sum is σ = 231928996320. Its totient is φ = 208295691120.
The previous prime is 220100110189. The next prime is 220100110261. The reversal of 220100110213 is 312011001022.
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 220100110213 - 237 = 82661156741 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 220100110193 and 220100110202.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (220100117213) 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, 6098278 + ... + 6134263.
It is an arithmetic number, because the mean of its divisors is an integer number (28991124540).
Almost surely, 2220100110213 is an apocalyptic number.
It is an amenable number.
220100110213 is a deficient number, since it is larger than the sum of its proper divisors (11828886107).
220100110213 is a wasteful number, since it uses less digits than its factorization.
220100110213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12233507.
The product of its (nonzero) digits is 24, while the sum is 13.
Adding to 220100110213 its reverse (312011001022), we get a palindrome (532111111235).
The spelling of 220100110213 in words is "two hundred twenty billion, one hundred million, one hundred ten thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •