1150169130 has 144 divisors (see below), whose sum is σ = 3394040832. Its totient is φ = 269755200.

The previous prime is 1150169089. The next prime is 1150169131. The reversal of 1150169130 is 319610511.

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

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (1150169131) by changing a digit.

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 71 ways as a sum of consecutive naturals, for example, 335887 + ... + 339293.

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

Almost surely, 2^1150169130 is an apocalyptic number.

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

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

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

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

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

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

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

The product of its (nonzero) digits is 810, while the sum is 27.

The square root of 1150169130 is about 33914.1435097512. The cubic root of 1150169130 is about 1047.7409117363.

Adding to 1150169130 its reverse (319610511), we get a palindrome (1469779641).

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