Search a number
-
+
1039869059 is a prime number
BaseRepresentation
bin111101111110110…
…010010010000011
32200110200211011212
4331332302102003
54112201302214
6251104000335
734524512135
oct7576622203
92613624155
101039869059
11493a85019
122503000ab
13137589248
149c169055
156145953e
hex3dfb2483

1039869059 has 2 divisors, whose sum is σ = 1039869060. Its totient is φ = 1039869058.

The previous prime is 1039869007. The next prime is 1039869071. The reversal of 1039869059 is 9509689301.

It is a strong prime.

It is a cyclic number.

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

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

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

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

Almost surely, 21039869059 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 524880, while the sum is 50.

The square root of 1039869059 is about 32247.0007752659. Note that the first 3 decimals coincide. The cubic root of 1039869059 is about 1013.1168814889.

Subtracting from 1039869059 its sum of digits (50), we obtain a square (1039869009 = 322472).

The spelling of 1039869059 in words is "one billion, thirty-nine million, eight hundred sixty-nine thousand, fifty-nine".