Base | Representation |
---|---|
bin | 110000100101010011… |
… | …1010011000111110011 |
3 | 100222022000020111220021 |
4 | 1201022213103013303 |
5 | 3202132220443102 |
6 | 115532400024311 |
7 | 10352264063056 |
oct | 1411247230763 |
9 | 328260214807 |
10 | 104331031027 |
11 | 40279168893 |
12 | 18278302097 |
13 | 9ab8ba52b2 |
14 | 509a344a9d |
15 | 2aa959d137 |
hex | 184a9d31f3 |
104331031027 has 2 divisors, whose sum is σ = 104331031028. Its totient is φ = 104331031026.
The previous prime is 104331030961. The next prime is 104331031073. The reversal of 104331031027 is 720130133401.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 104331031027 - 27 = 104331030899 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 104331030992 and 104331031010.
It is not a weakly prime, because it can be changed into another prime (104331031087) 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, 52165515513 + 52165515514.
It is an arithmetic number, because the mean of its divisors is an integer number (52165515514).
Almost surely, 2104331031027 is an apocalyptic number.
104331031027 is a deficient number, since it is larger than the sum of its proper divisors (1).
104331031027 is an equidigital number, since it uses as much as digits as its factorization.
104331031027 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1512, while the sum is 25.
Adding to 104331031027 its reverse (720130133401), we get a palindrome (824461164428).
The spelling of 104331031027 in words is "one hundred four billion, three hundred thirty-one million, thirty-one thousand, twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •