265011032 has 64 divisors (see below), whose sum is σ = 591010560. Its totient is φ = 109814400.

The previous prime is 265011001. The next prime is 265011041. The reversal of 265011032 is 230110562.

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

It is a congruent number.

It is an unprimeable number.

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

It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 93557 + ... + 96347.

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

Almost surely, 2^265011032 is an apocalyptic number.

265011032 is a gapful number since it is divisible by the number (22) 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 265011032, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (295505280).

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

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

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

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

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

The product of its (nonzero) digits is 360, while the sum is 20.

The square root of 265011032 is about 16279.1594377597. The cubic root of 265011032 is about 642.3247419756.

Adding to 265011032 its reverse (230110562), we get a palindrome (495121594).

The spelling of 265011032 in words is "two hundred sixty-five million, eleven thousand, thirty-two".