Base | Representation |
---|---|
bin | 1100110100010100000… |
… | …1010101101110000101 |
3 | 210001101012121121200011 |
4 | 3031011001111232011 |
5 | 12101433013423414 |
6 | 245054210150221 |
7 | 21623536155523 |
oct | 3150501255605 |
9 | 701335547604 |
10 | 220201311109 |
11 | 8542899923a |
12 | 36814b82371 |
13 | 179c361cac0 |
14 | a92d00b313 |
15 | 5adbc07dc4 |
hex | 3345055b85 |
220201311109 has 8 divisors (see below), whose sum is σ = 238950103392. Its totient is φ = 201711123120.
The previous prime is 220201311059. The next prime is 220201311133. The reversal of 220201311109 is 901113102022.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 220201311109 - 217 = 220201180037 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 220201311109.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (220201311809) 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, 64649299 + ... + 64652704.
It is an arithmetic number, because the mean of its divisors is an integer number (29868762924).
Almost surely, 2220201311109 is an apocalyptic number.
It is an amenable number.
220201311109 is a deficient number, since it is larger than the sum of its proper divisors (18748792283).
220201311109 is a wasteful number, since it uses less digits than its factorization.
220201311109 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 129302147.
The product of its (nonzero) digits is 216, while the sum is 22.
It can be divided in two parts, 2202013 and 11109, that added together give a palindrome (2213122).
The spelling of 220201311109 in words is "two hundred twenty billion, two hundred one million, three hundred eleven thousand, one hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.519 sec. • engine limits •