Base | Representation |
---|---|
bin | 1100110100000001001… |
… | …1001011000110001111 |
3 | 210001011200120021121111 |
4 | 3031000103023012033 |
5 | 12101302224200421 |
6 | 245042300312451 |
7 | 21621554656624 |
oct | 3150023130617 |
9 | 701150507544 |
10 | 220122100111 |
11 | 85398206901 |
12 | 367b2542727 |
13 | 179b00a78a4 |
14 | a9226ac34b |
15 | 5ad4cacee1 |
hex | 33404cb18f |
220122100111 has 8 divisors (see below), whose sum is σ = 220913521344. Its totient is φ = 219331289760.
The previous prime is 220122100103. The next prime is 220122100147. The reversal of 220122100111 is 111001221022.
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 220122100111 - 23 = 220122100103 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 220122100091 and 220122100100.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (220122100171) 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, 575466 + ... + 878296.
It is an arithmetic number, because the mean of its divisors is an integer number (27614190168).
Almost surely, 2220122100111 is an apocalyptic number.
220122100111 is a deficient number, since it is larger than the sum of its proper divisors (791421233).
220122100111 is a wasteful number, since it uses less digits than its factorization.
220122100111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 305441.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 220122100111 its reverse (111001221022), we get a palindrome (331123321133).
The spelling of 220122100111 in words is "two hundred twenty billion, one hundred twenty-two million, one hundred thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •