Base | Representation |
---|---|
bin | 110011101100101001… |
… | …1101100011100100101 |
3 | 101121120011201101210011 |
4 | 1213121103230130211 |
5 | 3304332110013221 |
6 | 123000223530221 |
7 | 11010115303324 |
oct | 1473123543445 |
9 | 347504641704 |
10 | 111020001061 |
11 | 430a0994aa2 |
12 | 19624459971 |
13 | a61391ab28 |
14 | 553285a0bb |
15 | 2d4b92a1e1 |
hex | 19d94ec725 |
111020001061 has 2 divisors, whose sum is σ = 111020001062. Its totient is φ = 111020001060.
The previous prime is 111020001019. The next prime is 111020001119. The reversal of 111020001061 is 160100020111.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 108574204036 + 2445797025 = 329506^2 + 49455^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-111020001061 is a prime.
It is a super-2 number, since 2×1110200010612 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (111020001461) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55510000530 + 55510000531.
It is an arithmetic number, because the mean of its divisors is an integer number (55510000531).
Almost surely, 2111020001061 is an apocalyptic number.
It is an amenable number.
111020001061 is a deficient number, since it is larger than the sum of its proper divisors (1).
111020001061 is an equidigital number, since it uses as much as digits as its factorization.
111020001061 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 12, while the sum is 13.
Adding to 111020001061 its reverse (160100020111), we get a palindrome (271120021172).
The spelling of 111020001061 in words is "one hundred eleven billion, twenty million, one thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •