Base | Representation |
---|---|
bin | 11110010001111… |
… | …111000111110000 |
3 | 1022101221200011110 |
4 | 132101333013300 |
5 | 2020024001342 |
6 | 122224513320 |
7 | 15406124214 |
oct | 3621770760 |
9 | 1271850143 |
10 | 508031472 |
11 | 240852623 |
12 | 12217b840 |
13 | 81337950 |
14 | 4b686944 |
15 | 2e902c9c |
hex | 1e47f1f0 |
508031472 has 80 divisors (see below), whose sum is σ = 1459017728. Its totient is φ = 151269120.
The previous prime is 508031449. The next prime is 508031473. The reversal of 508031472 is 274130805.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (508031473) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 6213 + ... + 32475.
Almost surely, 2508031472 is an apocalyptic number.
508031472 is a gapful number since it is divisible by the number (52) 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 508031472, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (729508864).
508031472 is an abundant number, since it is smaller than the sum of its proper divisors (950986256).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
508031472 is a wasteful number, since it uses less digits than its factorization.
508031472 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26318 (or 26312 counting only the distinct ones).
The product of its (nonzero) digits is 6720, while the sum is 30.
The square root of 508031472 is about 22539.5535004578. The cubic root of 508031472 is about 797.9276949079.
The spelling of 508031472 in words is "five hundred eight million, thirty-one thousand, four hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •