Base | Representation |
---|---|
bin | 1111110101100010000100… |
… | …0001000011000101000111 |
3 | 2021122121022200222201121202 |
4 | 3331120201001003011013 |
5 | 4240240443420401441 |
6 | 101011042422533115 |
7 | 3445000204232624 |
oct | 375304101030507 |
9 | 67577280881552 |
10 | 17412351340871 |
11 | 560359a435993 |
12 | 1b5276929719b |
13 | 993c92c8c2b6 |
14 | 442a95a8134b |
15 | 202e0655c19b |
hex | fd621043147 |
17412351340871 has 2 divisors, whose sum is σ = 17412351340872. Its totient is φ = 17412351340870.
The previous prime is 17412351340817. The next prime is 17412351340897. The reversal of 17412351340871 is 17804315321471.
Together with previous prime (17412351340817) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-17412351340871 is a prime.
It is a super-2 number, since 2×174123513408712 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (17412351340271) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 8706175670435 + 8706175670436.
It is an arithmetic number, because the mean of its divisors is an integer number (8706175670436).
Almost surely, 217412351340871 is an apocalyptic number.
17412351340871 is a deficient number, since it is larger than the sum of its proper divisors (1).
17412351340871 is an equidigital number, since it uses as much as digits as its factorization.
17412351340871 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 564480, while the sum is 47.
The spelling of 17412351340871 in words is "seventeen trillion, four hundred twelve billion, three hundred fifty-one million, three hundred forty thousand, eight hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •