Base | Representation |
---|---|
bin | 110100010110100100… |
… | …1100111110010011001 |
3 | 101202012012120101211002 |
4 | 1220231021213302121 |
5 | 3320222210143211 |
6 | 123351553114345 |
7 | 11060015505056 |
oct | 1505511476231 |
9 | 352165511732 |
10 | 112426646681 |
11 | 43752a02738 |
12 | 199575589b5 |
13 | a7a918540b |
14 | 56275bc02d |
15 | 2dd018403b |
hex | 1a2d267c99 |
112426646681 has 2 divisors, whose sum is σ = 112426646682. Its totient is φ = 112426646680.
The previous prime is 112426646671. The next prime is 112426646699. The reversal of 112426646681 is 186646624211.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 82656250000 + 29770396681 = 287500^2 + 172541^2 .
It is an emirp because it is prime and its reverse (186646624211) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 112426646681 - 210 = 112426645657 is a prime.
It is a super-2 number, since 2×1124266466812 (a number of 23 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (112426646621) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 56213323340 + 56213323341.
It is an arithmetic number, because the mean of its divisors is an integer number (56213323341).
Almost surely, 2112426646681 is an apocalyptic number.
It is an amenable number.
112426646681 is a deficient number, since it is larger than the sum of its proper divisors (1).
112426646681 is an equidigital number, since it uses as much as digits as its factorization.
112426646681 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 663552, while the sum is 47.
The spelling of 112426646681 in words is "one hundred twelve billion, four hundred twenty-six million, six hundred forty-six thousand, six hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •