Base | Representation |
---|---|
bin | 1111011111111111001110… |
… | …1101101000001111110101 |
3 | 2020100012221220021010221201 |
4 | 3313333303231220033311 |
5 | 4213204433331304203 |
6 | 100125031211212501 |
7 | 3406155125421163 |
oct | 367776355501765 |
9 | 66305856233851 |
10 | 17042224088053 |
11 | 54806262316aa |
12 | 1ab2a92447131 |
13 | 9680c854cb28 |
14 | 42cbc3080233 |
15 | 1e8492502e1d |
hex | f7ff3b683f5 |
17042224088053 has 2 divisors, whose sum is σ = 17042224088054. Its totient is φ = 17042224088052.
The previous prime is 17042224088039. The next prime is 17042224088101. The reversal of 17042224088053 is 35088042224071.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 13272192182404 + 3770031905649 = 3643102^2 + 1941657^2 .
It is a cyclic number.
It is not a de Polignac number, because 17042224088053 - 221 = 17042221990901 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 17042224087994 and 17042224088012.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (17042224088033) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 8521112044026 + 8521112044027.
It is an arithmetic number, because the mean of its divisors is an integer number (8521112044027).
Almost surely, 217042224088053 is an apocalyptic number.
It is an amenable number.
17042224088053 is a deficient number, since it is larger than the sum of its proper divisors (1).
17042224088053 is an equidigital number, since it uses as much as digits as its factorization.
17042224088053 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 860160, while the sum is 46.
The spelling of 17042224088053 in words is "seventeen trillion, forty-two billion, two hundred twenty-four million, eighty-eight thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •