Search a number
-
+
1019716429 is a prime number
BaseRepresentation
bin111100110001111…
…010001101001101
32122001202221222011
4330301322031031
54042021411204
6245104021221
734161306124
oct7461721515
92561687864
101019716429
11483670056
12245601811
13133351504
1499600abb
155e7c8304
hex3cc7a34d

1019716429 has 2 divisors, whose sum is σ = 1019716430. Its totient is φ = 1019716428.

The previous prime is 1019716403. The next prime is 1019716447. The reversal of 1019716429 is 9246179101.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 871607529 + 148108900 = 29523^2 + 12170^2 .

It is a cyclic number.

It is not a de Polignac number, because 1019716429 - 221 = 1017619277 is a prime.

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

It is a congruent number.

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

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

Almost surely, 21019716429 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 27216, while the sum is 40.

The square root of 1019716429 is about 31932.9990605330. Note that the first 3 decimals coincide. The cubic root of 1019716429 is about 1006.5294169245.

The spelling of 1019716429 in words is "one billion, nineteen million, seven hundred sixteen thousand, four hundred twenty-nine".