1150505070 has 128 divisors (see below), whose sum is σ = 3260694528. Its totient is φ = 256128000.

The previous prime is 1150505029. The next prime is 1150505071. The reversal of 1150505070 is 705050511.

It is a self number, because there is not a number n which added to its sum of digits gives 1150505070.

It is a congruent number.

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

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 63 ways as a sum of consecutive naturals, for example, 998995 + ... + 1000145.

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

Almost surely, 2^1150505070 is an apocalyptic number.

1150505070 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 1150505070, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1630347264).

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

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

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

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

The sum of its prime factors is 1418.

The product of its (nonzero) digits is 875, while the sum is 24.

The square root of 1150505070 is about 33919.0959490373. The cubic root of 1150505070 is about 1047.8429094367.

Adding to 1150505070 its reverse (705050511), we get a palindrome (1855555581).

The spelling of 1150505070 in words is "one billion, one hundred fifty million, five hundred five thousand, seventy".