Base | Representation |
---|---|
bin | 10111110101011001010001… |
… | …100111100111011001010101 |
3 | 111202011002221120100022012022 |
4 | 113311121101213213121111 |
5 | 102214420222314300103 |
6 | 1010535345412502525 |
7 | 31036210615352054 |
oct | 2765312147473125 |
9 | 452132846308168 |
10 | 104824341165653 |
11 | 3044483190656a |
12 | b90b7ab91aa45 |
13 | 4664b7ba99435 |
14 | 1bc574d16039b |
15 | c1bac599e138 |
hex | 5f56519e7655 |
104824341165653 has 2 divisors, whose sum is σ = 104824341165654. Its totient is φ = 104824341165652.
The previous prime is 104824341165629. The next prime is 104824341165707. The reversal of 104824341165653 is 356561143428401.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 94309095196369 + 10515245969284 = 9711287^2 + 3242722^2 .
It is a cyclic number.
It is not a de Polignac number, because 104824341165653 - 26 = 104824341165589 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 104824341165595 and 104824341165604.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (104824341195653) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 52412170582826 + 52412170582827.
It is an arithmetic number, because the mean of its divisors is an integer number (52412170582827).
Almost surely, 2104824341165653 is an apocalyptic number.
It is an amenable number.
104824341165653 is a deficient number, since it is larger than the sum of its proper divisors (1).
104824341165653 is an equidigital number, since it uses as much as digits as its factorization.
104824341165653 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 8294400, while the sum is 53.
The spelling of 104824341165653 in words is "one hundred four trillion, eight hundred twenty-four billion, three hundred forty-one million, one hundred sixty-five thousand, six hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •