Base | Representation |
---|---|
bin | 1101011000000… |
… | …01010111001011 |
3 | 21211010111212111 |
4 | 12230001113023 |
5 | 212211000321 |
6 | 15044523151 |
7 | 2531466031 |
oct | 654012713 |
9 | 254114774 |
10 | 112203211 |
11 | 58376a2a |
12 | 316b04b7 |
13 | 1a327143 |
14 | 10c8a551 |
15 | 9cb55e1 |
hex | 6b015cb |
112203211 has 4 divisors (see below), whose sum is σ = 114812632. Its totient is φ = 109593792.
The previous prime is 112203209. The next prime is 112203239. The reversal of 112203211 is 112302211.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 112302211 = 7 ⋅16043173.
It is a cyclic number.
It is not a de Polignac number, because 112203211 - 21 = 112203209 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 112203191 and 112203200.
It is not an unprimeable number, because it can be changed into a prime (112201211) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1304646 + ... + 1304731.
It is an arithmetic number, because the mean of its divisors is an integer number (28703158).
Almost surely, 2112203211 is an apocalyptic number.
112203211 is a deficient number, since it is larger than the sum of its proper divisors (2609421).
112203211 is an equidigital number, since it uses as much as digits as its factorization.
112203211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2609420.
The product of its (nonzero) digits is 24, while the sum is 13.
The square root of 112203211 is about 10592.6017106280. The cubic root of 112203211 is about 482.3198049238.
Adding to 112203211 its reverse (112302211), we get a palindrome (224505422).
The spelling of 112203211 in words is "one hundred twelve million, two hundred three thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •