Search a number
-
+
3873102413 is a prime number
BaseRepresentation
bin1110011011011010…
…1101101001001101
3100222220220222200112
43212312231221031
530413003234123
61440154005405
7164656553525
oct34666555115
910886828615
103873102413
1117082a1194
12901116865
1349955109b
1428a560685
1517a05ad78
hexe6dada4d

3873102413 has 2 divisors, whose sum is σ = 3873102414. Its totient is φ = 3873102412.

The previous prime is 3873102323. The next prime is 3873102451. The reversal of 3873102413 is 3142013783.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 1987198084 + 1885904329 = 44578^2 + 43427^2 .

It is an emirp because it is prime and its reverse (3142013783) is a distict prime.

It is a cyclic number.

It is not a de Polignac number, because 3873102413 - 28 = 3873102157 is a prime.

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

It is a congruent number.

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

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

Almost surely, 23873102413 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The square root of 3873102413 is about 62234.2543379448. The cubic root of 3873102413 is about 1570.4338953831.

The spelling of 3873102413 in words is "three billion, eight hundred seventy-three million, one hundred two thousand, four hundred thirteen".