Base | Representation |
---|---|
bin | 110100010010110011… |
… | …1101100011000010001 |
3 | 101201212101211221022211 |
4 | 1220211213230120101 |
5 | 3314442334441311 |
6 | 123331241232121 |
7 | 11053622621446 |
oct | 1504547543021 |
9 | 351771757284 |
10 | 112300312081 |
11 | 43698664681 |
12 | 19921192641 |
13 | a788c51109 |
14 | 56148d39cd |
15 | 2dc402b821 |
hex | 1a259ec611 |
112300312081 has 2 divisors, whose sum is σ = 112300312082. Its totient is φ = 112300312080.
The previous prime is 112300312073. The next prime is 112300312109. The reversal of 112300312081 is 180213003211.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 58100281600 + 54200030481 = 241040^2 + 232809^2 .
It is a cyclic number.
It is not a de Polignac number, because 112300312081 - 23 = 112300312073 is a prime.
It is a super-2 number, since 2×1123003120812 (a number of 23 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (112300312001) 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 as a sum of consecutive naturals, namely, 56150156040 + 56150156041.
It is an arithmetic number, because the mean of its divisors is an integer number (56150156041).
Almost surely, 2112300312081 is an apocalyptic number.
It is an amenable number.
112300312081 is a deficient number, since it is larger than the sum of its proper divisors (1).
112300312081 is an equidigital number, since it uses as much as digits as its factorization.
112300312081 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 288, while the sum is 22.
Adding to 112300312081 its reverse (180213003211), we get a palindrome (292513315292).
The spelling of 112300312081 in words is "one hundred twelve billion, three hundred million, three hundred twelve thousand, eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •