Base | Representation |
---|---|
bin | 10000000110110110110… |
… | …100000101101011100011 |
3 | 10220211000221011001210111 |
4 | 100012312310011223203 |
5 | 121113334132000024 |
6 | 2204254000512151 |
7 | 142653235145251 |
oct | 20066664055343 |
9 | 3824027131714 |
10 | 1106873703139 |
11 | 397471392996 |
12 | 15a62991b657 |
13 | 804bab91139 |
14 | 3b8043495d1 |
15 | 1dbd416da94 |
hex | 101b6d05ae3 |
1106873703139 has 2 divisors, whose sum is σ = 1106873703140. Its totient is φ = 1106873703138.
The previous prime is 1106873703119. The next prime is 1106873703197. The reversal of 1106873703139 is 9313073786011.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 1106873703139 - 27 = 1106873703011 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1106873703092 and 1106873703101.
It is not a weakly prime, because it can be changed into another prime (1106873703119) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 553436851569 + 553436851570.
It is an arithmetic number, because the mean of its divisors is an integer number (553436851570).
Almost surely, 21106873703139 is an apocalyptic number.
1106873703139 is a deficient number, since it is larger than the sum of its proper divisors (1).
1106873703139 is an equidigital number, since it uses as much as digits as its factorization.
1106873703139 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 571536, while the sum is 49.
The spelling of 1106873703139 in words is "one trillion, one hundred six billion, eight hundred seventy-three million, seven hundred three thousand, one hundred thirty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •