1305100500 has 384 divisors, whose sum is σ = 4579061760. Its totient is φ = 285120000.

The previous prime is 1305100493. The next prime is 1305100501. The reversal of 1305100500 is 50015031.

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

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

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (1305100501) 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 127 ways as a sum of consecutive naturals, for example, 7210410 + ... + 7210590.

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

Almost surely, 2^1305100500 is an apocalyptic number.

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

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

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

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

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

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

The product of its (nonzero) digits is 75, while the sum is 15.

The square root of 1305100500 is about 36126.1747213845. The cubic root of 1305100500 is about 1092.8183664070.

Adding to 1305100500 its reverse (50015031), we get a palindrome (1355115531).

The spelling of 1305100500 in words is "one billion, three hundred five million, one hundred thousand, five hundred".