1077095136 has 144 divisors (see below), whose sum is σ = 3086267184. Its totient is φ = 328753152.

The previous prime is 1077095113. The next prime is 1077095141. The reversal of 1077095136 is 6315907701.

It is a hoax number, since the sum of its digits (39) coincides with the sum of the digits of its distinct prime factors.

It is a Harshad number since it is a multiple of its sum of digits (39).

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

It is a congruent number.

It is an unprimeable number.

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

It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 3195960 + ... + 3196296.

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

Almost surely, 2^1077095136 is an apocalyptic number.

1077095136 is a gapful number since it is divisible by the number (16) formed by its first and last digit.

It is an amenable number.

It is a practical number, because each smaller number is the sum of distinct divisors of 1077095136, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1543133592).

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

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

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

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

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

The product of its (nonzero) digits is 39690, while the sum is 39.

The square root of 1077095136 is about 32819.1275935239. The cubic root of 1077095136 is about 1025.0648813977.

The spelling of 1077095136 in words is "one billion, seventy-seven million, ninety-five thousand, one hundred thirty-six".