Search a number
-
+
6925468271 is a prime number
BaseRepresentation
bin1100111001100101…
…00100001001101111
3122212122111020110212
412130302210021233
5103140404441041
63103112453035
7333422336411
oct63462441157
918778436425
106925468271
112a342788a7
1214133aa17b
13864a3b827
14499ab89b1
152a7ee58eb
hex19cca426f

6925468271 has 2 divisors, whose sum is σ = 6925468272. Its totient is φ = 6925468270.

The previous prime is 6925468267. The next prime is 6925468273. The reversal of 6925468271 is 1728645296.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 6925468271 - 22 = 6925468267 is a prime.

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

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

It is a Chen prime.

It is a congruent number.

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

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

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

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

Almost surely, 26925468271 is an apocalyptic number.

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

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

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

The product of its digits is 1451520, while the sum is 50.

The square root of 6925468271 is about 83219.3984056602. The cubic root of 6925468271 is about 1906.1177019627.

The spelling of 6925468271 in words is "six billion, nine hundred twenty-five million, four hundred sixty-eight thousand, two hundred seventy-one".