Base | Representation |
---|---|
bin | 100001100111110… |
… | …0000110101010001 |
3 | 2220121210110022011 |
4 | 1003033200311101 |
5 | 4302300440423 |
6 | 303535542521 |
7 | 36646014142 |
oct | 10317406521 |
9 | 2817713264 |
10 | 1128140113 |
11 | 529895401 |
12 | 27598aa41 |
13 | 14c954239 |
14 | a9b85ac9 |
15 | 69093b0d |
hex | 433e0d51 |
1128140113 has 2 divisors, whose sum is σ = 1128140114. Its totient is φ = 1128140112.
The previous prime is 1128140089. The next prime is 1128140137. The reversal of 1128140113 is 3110418211.
It is a balanced prime because it is at equal distance from previous prime (1128140089) and next prime (1128140137).
It can be written as a sum of positive squares in only one way, i.e., 1001532609 + 126607504 = 31647^2 + 11252^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1128140113 is a prime.
It is a super-2 number, since 2×11281401132 = 2545400229119305538, which contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (1128140173) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 564070056 + 564070057.
It is an arithmetic number, because the mean of its divisors is an integer number (564070057).
Almost surely, 21128140113 is an apocalyptic number.
It is an amenable number.
1128140113 is a deficient number, since it is larger than the sum of its proper divisors (1).
1128140113 is an equidigital number, since it uses as much as digits as its factorization.
1128140113 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 192, while the sum is 22.
The square root of 1128140113 is about 33587.7970846556. The cubic root of 1128140113 is about 1041.0086716064.
Adding to 1128140113 its reverse (3110418211), we get a palindrome (4238558324).
The spelling of 1128140113 in words is "one billion, one hundred twenty-eight million, one hundred forty thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.096 sec. • engine limits •