Search a number
-
+
6902492713 is a prime number
BaseRepresentation
bin1100110110110101…
…11010111000101001
3122211001020221221021
412123122322320221
5103114014231323
63100532212441
7333023135314
oct63332727051
918731227837
106902492713
112a22305a36
12140776a121
13860055c1c
14496a1797b
152a5ea805d
hex19b6bae29

6902492713 has 2 divisors, whose sum is σ = 6902492714. Its totient is φ = 6902492712.

The previous prime is 6902492687. The next prime is 6902492801. The reversal of 6902492713 is 3172942096.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 4620328729 + 2282163984 = 67973^2 + 47772^2 .

It is a cyclic number.

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

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

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

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

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

Almost surely, 26902492713 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 163296, while the sum is 43.

The square root of 6902492713 is about 83081.2416433457. The cubic root of 6902492713 is about 1904.0074890875.

The spelling of 6902492713 in words is "six billion, nine hundred two million, four hundred ninety-two thousand, seven hundred thirteen".