1036909051 has 2 divisors, whose sum is σ = 1036909052. Its totient is φ = 1036909050.

The previous prime is 1036909039. The next prime is 1036909057. The reversal of 1036909051 is 1509096301.

It is a strong prime.

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

It is a cyclic number.

It is not a de Polignac number, because 1036909051 - 2¹³ = 1036900859 is a prime.

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

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

It is a pernicious number, because its binary representation contains a prime number (23) of ones.

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

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

Almost surely, 2^1036909051 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 7290, while the sum is 34.

The square root of 1036909051 is about 32201.0722026457. The cubic root of 1036909051 is about 1012.1546821395.

The spelling of 1036909051 in words is "one billion, thirty-six million, nine hundred nine thousand, fifty-one".