Base | Representation |
---|---|
bin | 110100001111111010… |
… | …0101101011101110111 |
3 | 101201121121212002002001 |
4 | 1220133310231131313 |
5 | 3314242440423421 |
6 | 123313445000131 |
7 | 11051332166101 |
oct | 1503764553567 |
9 | 351547762061 |
10 | 112203061111 |
11 | 43648780579 |
12 | 198b46b3047 |
13 | a771a6096b |
14 | 5605a1a571 |
15 | 2dba71b691 |
hex | 1a1fd2d777 |
112203061111 has 4 divisors (see below), whose sum is σ = 118108485400. Its totient is φ = 106297636824.
The previous prime is 112203061099. The next prime is 112203061121. The reversal of 112203061111 is 111160302211.
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 112203061111 - 25 = 112203061079 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (19), and also a Moran number because the ratio is a prime number: 5905424269 = 112203061111 / (1 + 1 + 2 + 2 + 0 + 3 + 0 + 6 + 1 + 1 + 1 + 1).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (112203061121) 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, 2952712116 + ... + 2952712153.
It is an arithmetic number, because the mean of its divisors is an integer number (29527121350).
Almost surely, 2112203061111 is an apocalyptic number.
112203061111 is a deficient number, since it is larger than the sum of its proper divisors (5905424289).
112203061111 is an equidigital number, since it uses as much as digits as its factorization.
112203061111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5905424288.
The product of its (nonzero) digits is 72, while the sum is 19.
Adding to 112203061111 its reverse (111160302211), we get a palindrome (223363363322).
The spelling of 112203061111 in words is "one hundred twelve billion, two hundred three million, sixty-one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •