Base | Representation |
---|---|
bin | 11001100000111001101010… |
… | …011011101100101011101111 |
3 | 112201022101001021021001011202 |
4 | 121200321222123230223233 |
5 | 104201440340403033403 |
6 | 1034353305550040115 |
7 | 32431025321614622 |
oct | 3140715233545357 |
9 | 481271037231152 |
10 | 112212101221103 |
11 | 32832980859754 |
12 | 107035597a903b |
13 | 4a7c72bc69a50 |
14 | 1d9d147b1bdb9 |
15 | ce8d6322b688 |
hex | 660e6a6ecaef |
112212101221103 has 16 divisors (see below), whose sum is σ = 121744048042176. Its totient is φ = 102809888409600.
The previous prime is 112212101221043. The next prime is 112212101221139. The reversal of 112212101221103 is 301122101212211.
It is a cyclic number.
It is not a de Polignac number, because 112212101221103 - 28 = 112212101220847 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (112212101221153) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 21096476 + ... + 25874417.
It is an arithmetic number, because the mean of its divisors is an integer number (7609003002636).
Almost surely, 2112212101221103 is an apocalyptic number.
112212101221103 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
112212101221103 is a deficient number, since it is larger than the sum of its proper divisors (9531946821073).
112212101221103 is a wasteful number, since it uses less digits than its factorization.
112212101221103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 46972274.
The product of its (nonzero) digits is 96, while the sum is 20.
Adding to 112212101221103 its reverse (301122101212211), we get a palindrome (413334202433314).
The spelling of 112212101221103 in words is "one hundred twelve trillion, two hundred twelve billion, one hundred one million, two hundred twenty-one thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •