Search a number
-
+
507505152 = 2937211613
BaseRepresentation
bin11110001111111…
…110101000000000
31022100221221012010
4132033332220000
52014410131102
6122205332520
715401502600
oct3617765000
91270857163
10507505152
11240523150
12121b67140
13811b220b
144b58ac00
152e84bd6c
hex1e3fea00

507505152 has 240 divisors, whose sum is σ = 1718541792. Its totient is φ = 131604480.

The previous prime is 507505121. The next prime is 507505153. The reversal of 507505152 is 251505705.

It is a super-3 number, since 3×5075051523 (a number of 27 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.

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

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

Almost surely, 2507505152 is an apocalyptic number.

It is an amenable number.

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

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

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

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

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

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

The product of its (nonzero) digits is 8750, while the sum is 30.

The square root of 507505152 is about 22527.8749996532. The cubic root of 507505152 is about 797.6520489825.

The spelling of 507505152 in words is "five hundred seven million, five hundred five thousand, one hundred fifty-two".