Search a number
-
+
2017100681 is a prime number
BaseRepresentation
bin111100000111010…
…1000001110001001
312012120112022221122
41320032220032021
513112334210211
6532053245025
7100662034001
oct17016501611
95176468848
102017100681
11945667662
12483633775
13261b83bcb
14151c6b001
15bc13e6db
hex783a8389

2017100681 has 2 divisors, whose sum is σ = 2017100682. Its totient is φ = 2017100680.

The previous prime is 2017100639. The next prime is 2017100689. The reversal of 2017100681 is 1860017102.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 1957177600 + 59923081 = 44240^2 + 7741^2 .

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-2017100681 is a prime.

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

It is a Sophie Germain prime.

It is a Curzon number.

It is a self number, because there is not a number n which added to its sum of digits gives 2017100681.

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

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

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

Almost surely, 22017100681 is an apocalyptic number.

It is an amenable number.

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

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

2017100681 is an evil number, because the sum of its binary digits is even.

The product of its (nonzero) digits is 672, while the sum is 26.

The square root of 2017100681 is about 44912.1440258645. The cubic root of 2017100681 is about 1263.5017817048.

Adding to 2017100681 its reverse (1860017102), we get a palindrome (3877117783).

The spelling of 2017100681 in words is "two billion, seventeen million, one hundred thousand, six hundred eighty-one".