Base | Representation |
---|---|
bin | 10111101110011001101101… |
… | …100100100000011111000001 |
3 | 111200110011112000000110122212 |
4 | 113232121231210200133001 |
5 | 102134032022041311214 |
6 | 1005530511245511505 |
7 | 30656405662056461 |
oct | 2756315544403701 |
9 | 450404460013585 |
10 | 104343773775809 |
11 | 30279a45072767 |
12 | b852632872595 |
13 | 462b763907769 |
14 | 1baa3a0b27ba1 |
15 | c0e34adab53e |
hex | 5ee66d9207c1 |
104343773775809 has 2 divisors, whose sum is σ = 104343773775810. Its totient is φ = 104343773775808.
The previous prime is 104343773775803. The next prime is 104343773775811. The reversal of 104343773775809 is 908577377343401.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 104134167298225 + 209606477584 = 10204615^2 + 457828^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-104343773775809 is a prime.
It is a Sophie Germain prime.
Together with 104343773775811, it forms a pair of twin primes.
It is a Chen prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (104343773775803) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 52171886887904 + 52171886887905.
It is an arithmetic number, because the mean of its divisors is an integer number (52171886887905).
Almost surely, 2104343773775809 is an apocalyptic number.
It is an amenable number.
104343773775809 is a deficient number, since it is larger than the sum of its proper divisors (1).
104343773775809 is an equidigital number, since it uses as much as digits as its factorization.
104343773775809 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 373403520, while the sum is 68.
The spelling of 104343773775809 in words is "one hundred four trillion, three hundred forty-three billion, seven hundred seventy-three million, seven hundred seventy-five thousand, eight hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •