Base | Representation |
---|---|
bin | 11111111001001111… |
… | …00001011111001101 |
3 | 1122012100011200022102 |
4 | 33330213201133031 |
5 | 240032004333401 |
6 | 11511035524445 |
7 | 1144220061602 |
oct | 177447413715 |
9 | 48170150272 |
10 | 17123121101 |
11 | 7297612359 |
12 | 339a5b9725 |
13 | 17cb670b28 |
14 | b861ac6a9 |
15 | 6a33e756b |
hex | 3fc9e17cd |
17123121101 has 2 divisors, whose sum is σ = 17123121102. Its totient is φ = 17123121100.
The previous prime is 17123121061. The next prime is 17123121133. The reversal of 17123121101 is 10112132171.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 16186455076 + 936666025 = 127226^2 + 30605^2 .
It is an emirp because it is prime and its reverse (10112132171) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 17123121101 - 214 = 17123104717 is a prime.
It is a super-2 number, since 2×171231211012 (a number of 21 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (17123121161) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 8561560550 + 8561560551.
It is an arithmetic number, because the mean of its divisors is an integer number (8561560551).
Almost surely, 217123121101 is an apocalyptic number.
It is an amenable number.
17123121101 is a deficient number, since it is larger than the sum of its proper divisors (1).
17123121101 is an equidigital number, since it uses as much as digits as its factorization.
17123121101 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 84, while the sum is 20.
Adding to 17123121101 its reverse (10112132171), we get a palindrome (27235253272).
The spelling of 17123121101 in words is "seventeen billion, one hundred twenty-three million, one hundred twenty-one thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •