Search a number
-
+
6983050637 is a prime number
BaseRepresentation
bin1101000000011100…
…01110010110001101
3200000122211201122002
412200032032112031
5103300130110022
63112531002045
7335021644133
oct64016162615
920018751562
106983050637
112a63828332
12142a739325
13873950234
144a35c7753
152ad0bc092
hex1a038e58d

6983050637 has 2 divisors, whose sum is σ = 6983050638. Its totient is φ = 6983050636.

The previous prime is 6983050603. The next prime is 6983050651. The reversal of 6983050637 is 7360503896.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 6654317476 + 328733161 = 81574^2 + 18131^2 .

It is a cyclic number.

It is not a de Polignac number, because 6983050637 - 212 = 6983046541 is a prime.

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

It is a junction number, because it is equal to n+sod(n) for n = 6983050591 and 6983050600.

It is a congruent number.

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

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

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

Almost surely, 26983050637 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 816480, while the sum is 47.

The square root of 6983050637 is about 83564.6494458033. The cubic root of 6983050637 is about 1911.3859842366.

The spelling of 6983050637 in words is "six billion, nine hundred eighty-three million, fifty thousand, six hundred thirty-seven".