Base | Representation |
---|---|
bin | 11001011111011100100111… |
… | …110110110100100111100011 |
3 | 112200221211011222111201002220 |
4 | 121133130213312310213203 |
5 | 104143321241200311321 |
6 | 1034235344512242123 |
7 | 32420560554416202 |
oct | 3137344766644743 |
9 | 480854158451086 |
10 | 112112200010211 |
11 | 327a4576168345 |
12 | 106a8118b40343 |
13 | 4a7319aa688cb |
14 | 1d9838bc55239 |
15 | ce6467a079c6 |
hex | 65f727db49e3 |
112112200010211 has 16 divisors (see below), whose sum is σ = 149525357324160. Its totient is φ = 74720256727680.
The previous prime is 112112200010203. The next prime is 112112200010263. The reversal of 112112200010211 is 112010002211211.
It is a happy number.
It is not a de Polignac number, because 112112200010211 - 23 = 112112200010203 is a prime.
It is a super-2 number, since 2×1121122000102112 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (112112200010011) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 228939820 + ... + 229428998.
It is an arithmetic number, because the mean of its divisors is an integer number (9345334832760).
Almost surely, 2112112200010211 is an apocalyptic number.
112112200010211 is a deficient number, since it is larger than the sum of its proper divisors (37413157313949).
112112200010211 is a wasteful number, since it uses less digits than its factorization.
112112200010211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 510706.
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 112112200010211 its reverse (112010002211211), we get a palindrome (224122202221422).
The spelling of 112112200010211 in words is "one hundred twelve trillion, one hundred twelve billion, two hundred million, ten thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •