Base | Representation |
---|---|
bin | 10111111111010011001100… |
… | …101011000101011110010001 |
3 | 111211120011212120210102111112 |
4 | 113333103030223011132101 |
5 | 102312043230142134432 |
6 | 1012220155511023105 |
7 | 31136325341315132 |
oct | 2777231453053621 |
9 | 454504776712445 |
10 | 105505010505617 |
11 | 30687472a14168 |
12 | b9bb6b266aa95 |
13 | 46b41064245a8 |
14 | 1c0a681015c89 |
15 | c2e6629537b2 |
hex | 5ff4ccac5791 |
105505010505617 has 2 divisors, whose sum is σ = 105505010505618. Its totient is φ = 105505010505616.
The previous prime is 105505010505599. The next prime is 105505010505619. The reversal of 105505010505617 is 716505010505501.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 104121432328081 + 1383578177536 = 10203991^2 + 1176256^2 .
It is a cyclic number.
It is not a de Polignac number, because 105505010505617 - 220 = 105505009457041 is a prime.
It is a super-2 number, since 2×1055050105056172 (a number of 29 digits) contains 22 as substring.
Together with 105505010505619, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (105505010505619) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 52752505252808 + 52752505252809.
It is an arithmetic number, because the mean of its divisors is an integer number (52752505252809).
Almost surely, 2105505010505617 is an apocalyptic number.
It is an amenable number.
105505010505617 is a deficient number, since it is larger than the sum of its proper divisors (1).
105505010505617 is an equidigital number, since it uses as much as digits as its factorization.
105505010505617 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 131250, while the sum is 41.
The spelling of 105505010505617 in words is "one hundred five trillion, five hundred five billion, ten million, five hundred five thousand, six hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •