1027900536 has 32 divisors (see below), whose sum is σ = 2767425360. Its totient is φ = 316276992.

The previous prime is 1027900507. The next prime is 1027900553. The reversal of 1027900536 is 6350097201.

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

It is a congruent number.

It is an unprimeable number.

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

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1646965 + ... + 1647588.

Almost surely, 2^1027900536 is an apocalyptic number.

It is an amenable number.

1027900536 is an abundant number, since it is smaller than the sum of its proper divisors (1739524824).

It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.

1027900536 is a wasteful number, since it uses less digits than its factorization.

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

The sum of its prime factors is 3294575 (or 3294571 counting only the distinct ones).

The product of its (nonzero) digits is 11340, while the sum is 33.

The square root of 1027900536 is about 32060.8879477784. The cubic root of 1027900536 is about 1009.2150015781.

Adding to 1027900536 its reverse (6350097201), we get a palindrome (7377997737).

The spelling of 1027900536 in words is "one billion, twenty-seven million, nine hundred thousand, five hundred thirty-six".