Base | Representation |
---|---|
bin | 10111101101010001100010… |
… | …001011110100101000111101 |
3 | 111200011202110212021121200211 |
4 | 113231101202023310220331 |
5 | 102131244311434002221 |
6 | 1005431133102352421 |
7 | 30650663311215043 |
oct | 2755214213645075 |
9 | 450152425247624 |
10 | 104266273344061 |
11 | 3024a0950a5274 |
12 | b83b603b8b711 |
13 | 46243625b071a |
14 | 1ba672bd2a393 |
15 | c0c3120806e1 |
hex | 5ed4622f4a3d |
104266273344061 has 2 divisors, whose sum is σ = 104266273344062. Its totient is φ = 104266273344060.
The previous prime is 104266273344043. The next prime is 104266273344071. The reversal of 104266273344061 is 160443372662401.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 75236645296836 + 29029628047225 = 8673906^2 + 5387915^2 .
It is a cyclic number.
It is not a de Polignac number, because 104266273344061 - 213 = 104266273335869 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 104266273343996 and 104266273344014.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (104266273344001) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 52133136672030 + 52133136672031.
It is an arithmetic number, because the mean of its divisors is an integer number (52133136672031).
Almost surely, 2104266273344061 is an apocalyptic number.
It is an amenable number.
104266273344061 is a deficient number, since it is larger than the sum of its proper divisors (1).
104266273344061 is an equidigital number, since it uses as much as digits as its factorization.
104266273344061 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3483648, while the sum is 49.
The spelling of 104266273344061 in words is "one hundred four trillion, two hundred sixty-six billion, two hundred seventy-three million, three hundred forty-four thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •