Search a number
-
+
6691304251 is a prime number
BaseRepresentation
bin1100011101101010…
…10011001100111011
3122021022212110211101
412032311103030323
5102200433214001
63023545512231
7324550101442
oct61665231473
918238773741
106691304251
112924080a15
121368aa2677
13828382138
14476961d59
1529268da01
hex18ed5333b

6691304251 has 2 divisors, whose sum is σ = 6691304252. Its totient is φ = 6691304250.

The previous prime is 6691304239. The next prime is 6691304267. The reversal of 6691304251 is 1524031966.

It is a weak prime.

It is a cyclic number.

It is not a de Polignac number, because 6691304251 - 229 = 6154433339 is a prime.

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

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

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

Almost surely, 26691304251 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 38880, while the sum is 37.

The square root of 6691304251 is about 81800.3927313311. The cubic root of 6691304251 is about 1884.3876929698.

It can be divided in two parts, 669 and 1304251, that added together give a triangular number (1304920 = T1615).

The spelling of 6691304251 in words is "six billion, six hundred ninety-one million, three hundred four thousand, two hundred fifty-one".