Base | Representation |
---|---|
bin | 11001100000110111111001… |
… | …000111100000000011110111 |
3 | 112201022012010202222010211012 |
4 | 121200313321013200003313 |
5 | 104201422442211213421 |
6 | 1034352353154302435 |
7 | 32430630235432010 |
oct | 3140677107400367 |
9 | 481265122863735 |
10 | 112210200101111 |
11 | 32832095709102 |
12 | 10703108b87a1b |
13 | 4a7c4b8133488 |
14 | 1d9d007442007 |
15 | ce8ca139b95b |
hex | 660df91e00f7 |
112210200101111 has 4 divisors (see below), whose sum is σ = 128240228686992. Its totient is φ = 96180171515232.
The previous prime is 112210200101081. The next prime is 112210200101173. The reversal of 112210200101111 is 111101002012211.
It is a semiprime because it is the product of two primes.
It is not a de Polignac number, because 112210200101111 - 26 = 112210200101047 is a prime.
It is a super-2 number, since 2×1122102001011112 (a number of 29 digits) 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 (112210200101011) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 8015014292930 + ... + 8015014292943.
It is an arithmetic number, because the mean of its divisors is an integer number (32060057171748).
Almost surely, 2112210200101111 is an apocalyptic number.
112210200101111 is a deficient number, since it is larger than the sum of its proper divisors (16030028585881).
112210200101111 is an equidigital number, since it uses as much as digits as its factorization.
112210200101111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 16030028585880.
The product of its (nonzero) digits is 8, while the sum is 14.
Adding to 112210200101111 its reverse (111101002012211), we get a palindrome (223311202113322).
The spelling of 112210200101111 in words is "one hundred twelve trillion, two hundred ten billion, two hundred million, one hundred one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •