Base | Representation |
---|---|
bin | 110011010001011010… |
… | …0101100110010010111 |
3 | 101112012110200120112122 |
4 | 1212202310230302113 |
5 | 3300444103000302 |
6 | 122325411410155 |
7 | 10645345522154 |
oct | 1464264546227 |
9 | 345173616478 |
10 | 110105906327 |
11 | 42771a060aa |
12 | 1940a2b395b |
13 | a4c942ab81 |
14 | 54872b122b |
15 | 2ce65673a2 |
hex | 19a2d2cc97 |
110105906327 has 2 divisors, whose sum is σ = 110105906328. Its totient is φ = 110105906326.
The previous prime is 110105906297. The next prime is 110105906329. The reversal of 110105906327 is 723609501011.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-110105906327 is a prime.
Together with 110105906329, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (110105906329) 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, 55052953163 + 55052953164.
It is an arithmetic number, because the mean of its divisors is an integer number (55052953164).
Almost surely, 2110105906327 is an apocalyptic number.
110105906327 is a deficient number, since it is larger than the sum of its proper divisors (1).
110105906327 is an equidigital number, since it uses as much as digits as its factorization.
110105906327 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 11340, while the sum is 35.
The spelling of 110105906327 in words is "one hundred ten billion, one hundred five million, nine hundred six thousand, three hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •