Base | Representation |
---|---|
bin | 1000010000010110… |
… | …0011110110111111 |
3 | 12201102220000021001 |
4 | 2010011203312333 |
5 | 14014302100421 |
6 | 1003521351131 |
7 | 105626054332 |
oct | 20405436677 |
9 | 5642800231 |
10 | 2216050111 |
11 | a379a2280 |
12 | 51a1984a7 |
13 | 294160c72 |
14 | 170458619 |
15 | ce83c691 |
hex | 84163dbf |
2216050111 has 4 divisors (see below), whose sum is σ = 2417509224. Its totient is φ = 2014591000.
The previous prime is 2216050099. The next prime is 2216050121. The reversal of 2216050111 is 1110506122.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 2216050111 - 223 = 2207661503 is a prime.
It is a super-2 number, since 2×22160501112 = 9821756188926224642, which 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 (2216050121) 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 3 ways as a sum of consecutive naturals, for example, 100729540 + ... + 100729561.
It is an arithmetic number, because the mean of its divisors is an integer number (604377306).
Almost surely, 22216050111 is an apocalyptic number.
2216050111 is a deficient number, since it is larger than the sum of its proper divisors (201459113).
2216050111 is a wasteful number, since it uses less digits than its factorization.
2216050111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 201459112.
The product of its (nonzero) digits is 120, while the sum is 19.
The square root of 2216050111 is about 47074.9414338457. The cubic root of 2216050111 is about 1303.7466102101.
Adding to 2216050111 its reverse (1110506122), we get a palindrome (3326556233).
The spelling of 2216050111 in words is "two billion, two hundred sixteen million, fifty thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •