Base | Representation |
---|---|
bin | 10000001001011110000… |
… | …111001000001001100111 |
3 | 10221002021112121120020201 |
4 | 100021132013020021213 |
5 | 121140111201122223 |
6 | 2205440304011331 |
7 | 143112626345506 |
oct | 20113607101147 |
9 | 3832245546221 |
10 | 1109680489063 |
11 | 398681785783 |
12 | 15b091900b47 |
13 | 80847526003 |
14 | 3b9cd01883d |
15 | 1dcea798ead |
hex | 1025e1c8267 |
1109680489063 has 2 divisors, whose sum is σ = 1109680489064. Its totient is φ = 1109680489062.
The previous prime is 1109680488953. The next prime is 1109680489157. The reversal of 1109680489063 is 3609840869011.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 1109680489063 - 221 = 1109678391911 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1109680488995 and 1109680489013.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1109680489663) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 554840244531 + 554840244532.
It is an arithmetic number, because the mean of its divisors is an integer number (554840244532).
Almost surely, 21109680489063 is an apocalyptic number.
1109680489063 is a deficient number, since it is larger than the sum of its proper divisors (1).
1109680489063 is an equidigital number, since it uses as much as digits as its factorization.
1109680489063 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2239488, while the sum is 55.
The spelling of 1109680489063 in words is "one trillion, one hundred nine billion, six hundred eighty million, four hundred eighty-nine thousand, sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •