Base | Representation |
---|---|
bin | 110100010000001011… |
… | …1100101011001101001 |
3 | 101201122021001112112201 |
4 | 1220200113211121221 |
5 | 3314302310444423 |
6 | 123314412540201 |
7 | 11051502663133 |
oct | 1504027453151 |
9 | 351567045481 |
10 | 112212203113 |
11 | 4365295504a |
12 | 198b7781661 |
13 | a773911b2a |
14 | 5606d1a053 |
15 | 2dbb4252ad |
hex | 1a205e5669 |
112212203113 has 8 divisors (see below), whose sum is σ = 118128612320. Its totient is φ = 106296844320.
The previous prime is 112212203071. The next prime is 112212203137. The reversal of 112212203113 is 311302212211.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-112212203113 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (19).
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (112212203813) 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 7 ways as a sum of consecutive naturals, for example, 38403 + ... + 475288.
It is an arithmetic number, because the mean of its divisors is an integer number (14766076540).
Almost surely, 2112212203113 is an apocalyptic number.
It is an amenable number.
112212203113 is a deficient number, since it is larger than the sum of its proper divisors (5916409207).
112212203113 is a wasteful number, since it uses less digits than its factorization.
112212203113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 525207.
The product of its (nonzero) digits is 144, while the sum is 19.
Adding to 112212203113 its reverse (311302212211), we get a palindrome (423514415324).
The spelling of 112212203113 in words is "one hundred twelve billion, two hundred twelve million, two hundred three thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •