Base | Representation |
---|---|
bin | 100001011000010… |
… | …0110000100101001 |
3 | 2220001112200022222 |
4 | 1002300212010221 |
5 | 4243212110423 |
6 | 303050123425 |
7 | 36520066331 |
oct | 10260460451 |
9 | 2801480288 |
10 | 1120035113 |
11 | 525259a5a |
12 | 273120575 |
13 | 14b077092 |
14 | a8a760c1 |
15 | 684e23c8 |
hex | 42c26129 |
1120035113 has 2 divisors, whose sum is σ = 1120035114. Its totient is φ = 1120035112.
The previous prime is 1120035079. The next prime is 1120035139. The reversal of 1120035113 is 3115300211.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 856557289 + 263477824 = 29267^2 + 16232^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1120035113 is a prime.
It is a zygodrome in base 3.
It is a junction number, because it is equal to n+sod(n) for n = 1120035091 and 1120035100.
It is not a weakly prime, because it can be changed into another prime (1120035613) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 560017556 + 560017557.
It is an arithmetic number, because the mean of its divisors is an integer number (560017557).
Almost surely, 21120035113 is an apocalyptic number.
It is an amenable number.
1120035113 is a deficient number, since it is larger than the sum of its proper divisors (1).
1120035113 is an equidigital number, since it uses as much as digits as its factorization.
1120035113 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 90, while the sum is 17.
The square root of 1120035113 is about 33466.9256580284. The cubic root of 1120035113 is about 1038.5096728786.
Adding to 1120035113 its reverse (3115300211), we get a palindrome (4235335324).
The spelling of 1120035113 in words is "one billion, one hundred twenty million, thirty-five thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •