Base | Representation |
---|---|
bin | 110100100011100100… |
… | …0110010110111100101 |
3 | 101210022120222000211201 |
4 | 1221013020302313211 |
5 | 3322120313400131 |
6 | 123503130002501 |
7 | 11103561406333 |
oct | 1510710626745 |
9 | 353276860751 |
10 | 112862637541 |
11 | 43957020065 |
12 | 19a59576431 |
13 | a8485b8784 |
14 | 5669470b53 |
15 | 2e085a6761 |
hex | 1a47232de5 |
112862637541 has 2 divisors, whose sum is σ = 112862637542. Its totient is φ = 112862637540.
The previous prime is 112862637491. The next prime is 112862637649. The reversal of 112862637541 is 145736268211.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 110320965316 + 2541672225 = 332146^2 + 50415^2 .
It is a cyclic number.
It is not a de Polignac number, because 112862637541 - 215 = 112862604773 is a prime.
It is a super-2 number, since 2×1128626375412 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 112862637491 and 112862637500.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (112862637841) 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, 56431318770 + 56431318771.
It is an arithmetic number, because the mean of its divisors is an integer number (56431318771).
Almost surely, 2112862637541 is an apocalyptic number.
It is an amenable number.
112862637541 is a deficient number, since it is larger than the sum of its proper divisors (1).
112862637541 is an equidigital number, since it uses as much as digits as its factorization.
112862637541 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 483840, while the sum is 46.
The spelling of 112862637541 in words is "one hundred twelve billion, eight hundred sixty-two million, six hundred thirty-seven thousand, five hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •