Base | Representation |
---|---|
bin | 110100001111111000… |
… | …1000011000100010011 |
3 | 101201121120001022001210 |
4 | 1220133301003010103 |
5 | 3314242214213021 |
6 | 123313412231203 |
7 | 11051321060010 |
oct | 1503761030423 |
9 | 351546038053 |
10 | 112202101011 |
11 | 43648185200 |
12 | 198b430b503 |
13 | a7717b5960 |
14 | 560584a707 |
15 | 2dba5cbe76 |
hex | 1a1fc43113 |
112202101011 has 96 divisors (see below), whose sum is σ = 204184834560. Its totient is φ = 53325296640.
The previous prime is 112202101001. The next prime is 112202101019. The reversal of 112202101011 is 110101202211.
It is not a de Polignac number, because 112202101011 - 215 = 112202068243 is a prime.
It is a super-2 number, since 2×1122021010112 (a number of 23 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (112202101019) 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 95 ways as a sum of consecutive naturals, for example, 3717700 + ... + 3747758.
It is an arithmetic number, because the mean of its divisors is an integer number (2126925360).
Almost surely, 2112202101011 is an apocalyptic number.
112202101011 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
112202101011 is a deficient number, since it is larger than the sum of its proper divisors (91982733549).
112202101011 is a wasteful number, since it uses less digits than its factorization.
112202101011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 30217 (or 30206 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 112202101011 its reverse (110101202211), we get a palindrome (222303303222).
The spelling of 112202101011 in words is "one hundred twelve billion, two hundred two million, one hundred one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •