Base | Representation |
---|---|
bin | 10000001001111010101… |
… | …100101110111110110001 |
3 | 10221010111222002210210012 |
4 | 100021322230232332301 |
5 | 121142101442000424 |
6 | 2210000035544305 |
7 | 143130542143004 |
oct | 20117254567661 |
9 | 3833458083705 |
10 | 1110160109489 |
11 | 3988a84926a2 |
12 | 15b1a645b095 |
13 | 808c29c3c92 |
14 | 3ba369c753b |
15 | 1dd27938b0e |
hex | 1027ab2efb1 |
1110160109489 has 2 divisors, whose sum is σ = 1110160109490. Its totient is φ = 1110160109488.
The previous prime is 1110160109459. The next prime is 1110160109503. The reversal of 1110160109489 is 9849010610111.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 668646373264 + 441513736225 = 817708^2 + 664465^2 .
It is a cyclic number.
It is not a de Polignac number, because 1110160109489 - 216 = 1110160043953 is a prime.
It is a super-2 number, since 2×11101601094892 (a number of 25 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (1110160109449) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 555080054744 + 555080054745.
It is an arithmetic number, because the mean of its divisors is an integer number (555080054745).
Almost surely, 21110160109489 is an apocalyptic number.
It is an amenable number.
1110160109489 is a deficient number, since it is larger than the sum of its proper divisors (1).
1110160109489 is an equidigital number, since it uses as much as digits as its factorization.
1110160109489 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 15552, while the sum is 41.
The spelling of 1110160109489 in words is "one trillion, one hundred ten billion, one hundred sixty million, one hundred nine thousand, four hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •