Base | Representation |
---|---|
bin | 110100001111111100… |
… | …1000110111101010111 |
3 | 101201121201000122200110 |
4 | 1220133321012331113 |
5 | 3314243234322403 |
6 | 123313525414103 |
7 | 11051345040432 |
oct | 1503771067527 |
9 | 351551018613 |
10 | 112204214103 |
11 | 43649398863 |
12 | 198b4b6a333 |
13 | a7720756c7 |
14 | 5605c3a819 |
15 | 2dba898103 |
hex | 1a1fe46f57 |
112204214103 has 8 divisors (see below), whose sum is σ = 149608843888. Its totient is φ = 74801196864.
The previous prime is 112204214077. The next prime is 112204214137. The reversal of 112204214103 is 301412402211.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 112204214103 - 26 = 112204214039 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 112204214103.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (112204214303) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 230176 + ... + 526677.
It is an arithmetic number, because the mean of its divisors is an integer number (18701105486).
Almost surely, 2112204214103 is an apocalyptic number.
112204214103 is a deficient number, since it is larger than the sum of its proper divisors (37404629785).
112204214103 is an equidigital number, since it uses as much as digits as its factorization.
112204214103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 806273.
The product of its (nonzero) digits is 384, while the sum is 21.
Adding to 112204214103 its reverse (301412402211), we get a palindrome (413616616314).
The spelling of 112204214103 in words is "one hundred twelve billion, two hundred four million, two hundred fourteen thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •