Search a number
-
+
506907072 = 2634761229
BaseRepresentation
bin11110001101101…
…100100111000000
31022022211112210000
4132031230213000
52014232011242
6122144440000
715363432120
oct3615544700
91268745700
10506907072
11240154871
12121919000
1381032c19
144b472c80
152e77ea4c
hex1e36c9c0

506907072 has 280 divisors, whose sum is σ = 1753067360. Its totient is φ = 141834240.

The previous prime is 506907047. The next prime is 506907073. The reversal of 506907072 is 270709605.

It is a super-2 number, since 2×5069070722 = 513909559287226368, which contains 22 as substring.

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

It is a congruent number.

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

It is a polite number, since it can be written in 39 ways as a sum of consecutive naturals, for example, 2213454 + ... + 2213682.

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

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

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

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

506907072 is an evil number, because the sum of its binary digits is even.

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

The product of its (nonzero) digits is 26460, while the sum is 36.

The square root of 506907072 is about 22514.5968651451. The cubic root of 506907072 is about 797.3385892677.

The spelling of 506907072 in words is "five hundred six million, nine hundred seven thousand, seventy-two".