Search a number
-
+
6751705001 is a prime number
BaseRepresentation
bin1100100100110111…
…01101011110101001
3122102112112011002012
412102123231132221
5102311414030001
63033544245305
7326212355066
oct62233553651
918375464065
106751705001
112955185998
121385170835
13837a3c622
144809a5c6d
15297b202bb
hex1926ed7a9

6751705001 has 2 divisors, whose sum is σ = 6751705002. Its totient is φ = 6751705000.

The previous prime is 6751704941. The next prime is 6751705013. The reversal of 6751705001 is 1005071576.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 5692853401 + 1058851600 = 75451^2 + 32540^2 .

It is a cyclic number.

It is not a de Polignac number, because 6751705001 - 210 = 6751703977 is a prime.

It is a super-3 number, since 3×67517050013 (a number of 30 digits) contains 333 as substring.

It is a Sophie Germain prime.

It is a Curzon number.

It is not a weakly prime, because it can be changed into another prime (6751705201) 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, 3375852500 + 3375852501.

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

Almost surely, 26751705001 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 7350, while the sum is 32.

The square root of 6751705001 is about 82168.7592762602. The cubic root of 6751705001 is about 1890.0406849019.

Adding to 6751705001 its reverse (1005071576), we get a palindrome (7756776577).

The spelling of 6751705001 in words is "six billion, seven hundred fifty-one million, seven hundred five thousand, one".