Base | Representation |
---|---|
bin | 10111101011110100011100… |
… | …110000010010101000100101 |
3 | 111122211012111020102121212201 |
4 | 113223310130300102220211 |
5 | 102123130113002014143 |
6 | 1005313203154414501 |
7 | 30640524423022552 |
oct | 2753643460225045 |
9 | 448735436377781 |
10 | 104166324251173 |
11 | 3021076547a468 |
12 | b82416b291431 |
13 | 4617ac44b6242 |
14 | 1ba196995ba29 |
15 | c0991254e64d |
hex | 5ebd1cc12a25 |
104166324251173 has 2 divisors, whose sum is σ = 104166324251174. Its totient is φ = 104166324251172.
The previous prime is 104166324251071. The next prime is 104166324251179. The reversal of 104166324251173 is 371152423661401.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 55880752967649 + 48285571283524 = 7475343^2 + 6948782^2 .
It is a cyclic number.
It is not a de Polignac number, because 104166324251173 - 221 = 104166322154021 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (104166324251179) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 52083162125586 + 52083162125587.
It is an arithmetic number, because the mean of its divisors is an integer number (52083162125587).
Almost surely, 2104166324251173 is an apocalyptic number.
It is an amenable number.
104166324251173 is a deficient number, since it is larger than the sum of its proper divisors (1).
104166324251173 is an equidigital number, since it uses as much as digits as its factorization.
104166324251173 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 725760, while the sum is 46.
The spelling of 104166324251173 in words is "one hundred four trillion, one hundred sixty-six billion, three hundred twenty-four million, two hundred fifty-one thousand, one hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •