[go: up one dir, main page]

Search a number
-
+
17091313 is a prime number
BaseRepresentation
bin100000100110…
…0101011110001
31012011022212121
41001030223301
513333410223
61410154241
7265162621
oct101145361
935138777
1017091313
119713a58
125882981
133705505
1423ac881
15177915d
hex104caf1

17091313 has 2 divisors, whose sum is σ = 17091314. Its totient is φ = 17091312.

The previous prime is 17091311. The next prime is 17091331. The reversal of 17091313 is 31319071.

Together with next prime (17091331) it forms an Ormiston pair, because they use the same digits, order apart.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 15303744 + 1787569 = 3912^2 + 1337^2 .

It is a cyclic number.

It is not a de Polignac number, because 17091313 - 21 = 17091311 is a prime.

It is a super-2 number, since 2×170913132 = 584225960127938, which contains 22 as substring.

Together with 17091311, it forms a pair of twin primes.

It is not a weakly prime, because it can be changed into another prime (17091311) by changing a digit.

It is a pernicious number, because its binary representation contains a prime number (11) of ones.

It is a polite number, since it can be written as a sum of consecutive naturals, namely, 8545656 + 8545657.

It is an arithmetic number, because the mean of its divisors is an integer number (8545657).

Almost surely, 217091313 is an apocalyptic number.

It is an amenable number.

17091313 is a deficient number, since it is larger than the sum of its proper divisors (1).

17091313 is an equidigital number, since it uses as much as digits as its factorization.

17091313 is an odious number, because the sum of its binary digits is odd.

The product of its (nonzero) digits is 567, while the sum is 25.

The square root of 17091313 is about 4134.1641234958. The cubic root of 17091313 is about 257.5877126017.

The spelling of 17091313 in words is "seventeen million, ninety-one thousand, three hundred thirteen".