Base | Representation |
---|---|
bin | 11001100000110000010001… |
… | …100011010010010000100011 |
3 | 112201021102000200212012012201 |
4 | 121200300101203102100203 |
5 | 104201304214121300303 |
6 | 1034344521344434031 |
7 | 32430220440542422 |
oct | 3140602143222043 |
9 | 481242020765181 |
10 | 112202020103203 |
11 | 3282967827a658 |
12 | 10701605618917 |
13 | 4a7b7b351a424 |
14 | 1d9c86ccc12b9 |
15 | ce897319881d |
hex | 660c118d2423 |
112202020103203 has 4 divisors (see below), whose sum is σ = 112202111270808. Its totient is φ = 112201928935600.
The previous prime is 112202020103179. The next prime is 112202020103249. The reversal of 112202020103203 is 302301020202211.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-112202020103203 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (112202020103273) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 43712101 + ... + 46207702.
It is an arithmetic number, because the mean of its divisors is an integer number (28050527817702).
Almost surely, 2112202020103203 is an apocalyptic number.
112202020103203 is a deficient number, since it is larger than the sum of its proper divisors (91167605).
112202020103203 is an equidigital number, since it uses as much as digits as its factorization.
112202020103203 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 91167604.
The product of its (nonzero) digits is 288, while the sum is 19.
Adding to 112202020103203 its reverse (302301020202211), we get a palindrome (414503040305414).
The spelling of 112202020103203 in words is "one hundred twelve trillion, two hundred two billion, twenty million, one hundred three thousand, two hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •