Base | Representation |
---|---|
bin | 100000000010111110000… |
… | …000101010010101101011 |
3 | 21210112021212201001110111 |
4 | 200002332000222111223 |
5 | 242040112020200021 |
6 | 4403403134355151 |
7 | 315050562331546 |
oct | 40027600522553 |
9 | 7715255631414 |
10 | 2202211100011 |
11 | 779a5283316a |
12 | 2b697805bab7 |
13 | 12c88a9a0340 |
14 | 7883249b85d |
15 | 3c4406128e1 |
hex | 200be02a56b |
2202211100011 has 16 divisors (see below), whose sum is σ = 2496852288000. Its totient is φ = 1925497273248.
The previous prime is 2202211099999. The next prime is 2202211100029. The reversal of 2202211100011 is 1100011122022.
It is a cyclic number.
It is not a de Polignac number, because 2202211100011 - 217 = 2202210968939 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (13).
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2202211099964 and 2202211100000.
It is not an unprimeable number, because it can be changed into a prime (2202211100041) 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 15 ways as a sum of consecutive naturals, for example, 734190 + ... + 2223388.
It is an arithmetic number, because the mean of its divisors is an integer number (156053268000).
Almost surely, 22202211100011 is an apocalyptic number.
2202211100011 is a deficient number, since it is larger than the sum of its proper divisors (294641187989).
2202211100011 is a wasteful number, since it uses less digits than its factorization.
2202211100011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1495218.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 2202211100011 its reverse (1100011122022), we get a palindrome (3302222222033).
The spelling of 2202211100011 in words is "two trillion, two hundred two billion, two hundred eleven million, one hundred thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •