Base | Representation |
---|---|
bin | 10111101110011001101101… |
… | …100101100000111110100011 |
3 | 111200110011112000111220000122 |
4 | 113232121231211200332203 |
5 | 102134032022123234341 |
6 | 1005530511255310455 |
7 | 30656405664236564 |
oct | 2756315545407643 |
9 | 450404460456018 |
10 | 104343774039971 |
11 | 30279a45233184 |
12 | b85263297b42b |
13 | 462b76399aa7b |
14 | 1baa3a0b9616b |
15 | c0e34ae0e94b |
hex | 5ee66d960fa3 |
104343774039971 has 2 divisors, whose sum is σ = 104343774039972. Its totient is φ = 104343774039970.
The previous prime is 104343774039851. The next prime is 104343774039979. The reversal of 104343774039971 is 179930477343401.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-104343774039971 is a prime.
It is not a weakly prime, because it can be changed into another prime (104343774039979) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 52171887019985 + 52171887019986.
It is an arithmetic number, because the mean of its divisors is an integer number (52171887019986).
Almost surely, 2104343774039971 is an apocalyptic number.
104343774039971 is a deficient number, since it is larger than the sum of its proper divisors (1).
104343774039971 is an equidigital number, since it uses as much as digits as its factorization.
104343774039971 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 48009024, while the sum is 62.
The spelling of 104343774039971 in words is "one hundred four trillion, three hundred forty-three billion, seven hundred seventy-four million, thirty-nine thousand, nine hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •