Base | Representation |
---|---|
bin | 100001011000011… |
… | …1000110111110001 |
3 | 2220001200120221211 |
4 | 1002300320313301 |
5 | 4243222041423 |
6 | 303051520121 |
7 | 36520536661 |
oct | 10260706761 |
9 | 2801616854 |
10 | 1120112113 |
11 | 52530189a |
12 | 273159041 |
13 | 14b0a3143 |
14 | a8a961a1 |
15 | 6850a10d |
hex | 42c38df1 |
1120112113 has 2 divisors, whose sum is σ = 1120112114. Its totient is φ = 1120112112.
The previous prime is 1120112101. The next prime is 1120112143. The reversal of 1120112113 is 3112110211.
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., 625850289 + 494261824 = 25017^2 + 22232^2 .
It is a cyclic number.
It is not a de Polignac number, because 1120112113 - 213 = 1120103921 is a prime.
It is a super-2 number, since 2×11201121132 = 2509302291378649538, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1120112093 and 1120112102.
It is not a weakly prime, because it can be changed into another prime (1120112143) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 560056056 + 560056057.
It is an arithmetic number, because the mean of its divisors is an integer number (560056057).
Almost surely, 21120112113 is an apocalyptic number.
It is an amenable number.
1120112113 is a deficient number, since it is larger than the sum of its proper divisors (1).
1120112113 is an equidigital number, since it uses as much as digits as its factorization.
1120112113 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 12, while the sum is 13.
The square root of 1120112113 is about 33468.0760277611. The cubic root of 1120112113 is about 1038.5334707671.
Adding to 1120112113 its reverse (3112110211), we get a palindrome (4232222324).
The spelling of 1120112113 in words is "one billion, one hundred twenty million, one hundred twelve thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •