Base | Representation |
---|---|
bin | 110100001101001110… |
… | …1101010011001001101 |
3 | 101201101100122021002012 |
4 | 1220122131222121031 |
5 | 3314101430230013 |
6 | 123300513311005 |
7 | 11046160623311 |
oct | 1503235523115 |
9 | 351340567065 |
10 | 112113133133 |
11 | 43601a39331 |
12 | 1988a565465 |
13 | a759235741 |
14 | 55d7acbb41 |
15 | 2db28a61a8 |
hex | 1a1a76a64d |
112113133133 has 2 divisors, whose sum is σ = 112113133134. Its totient is φ = 112113133132.
The previous prime is 112113133063. The next prime is 112113133151. The reversal of 112113133133 is 331331311211.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 103933377769 + 8179755364 = 322387^2 + 90442^2 .
It is a cyclic number.
It is not a de Polignac number, because 112113133133 - 28 = 112113132877 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 112113133099 and 112113133108.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (112113133733) 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, 56056566566 + 56056566567.
It is an arithmetic number, because the mean of its divisors is an integer number (56056566567).
Almost surely, 2112113133133 is an apocalyptic number.
It is an amenable number.
112113133133 is a deficient number, since it is larger than the sum of its proper divisors (1).
112113133133 is an equidigital number, since it uses as much as digits as its factorization.
112113133133 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 486, while the sum is 23.
Adding to 112113133133 its reverse (331331311211), we get a palindrome (443444444344).
The spelling of 112113133133 in words is "one hundred twelve billion, one hundred thirteen million, one hundred thirty-three thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •