Base | Representation |
---|---|
bin | 11110001100101… |
… | …001011001010000 |
3 | 1022022022120010021 |
4 | 132030221121100 |
5 | 2014144204020 |
6 | 122134513224 |
7 | 15361204345 |
oct | 3614513120 |
9 | 1268276107 |
10 | 506631760 |
11 | 23aa86a38 |
12 | 121805814 |
13 | 80c6780b |
14 | 4b4007cc |
15 | 2e7281aa |
hex | 1e329650 |
506631760 has 80 divisors (see below), whose sum is σ = 1221921792. Its totient is φ = 195148800.
The previous prime is 506631757. The next prime is 506631767. The reversal of 506631760 is 67136605.
It is a happy number.
It is a tau number, because it is divible by the number of its divisors (80).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (506631767) 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 15 ways as a sum of consecutive naturals, for example, 696517 + ... + 697243.
Almost surely, 2506631760 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 506631760, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (610960896).
506631760 is an abundant number, since it is smaller than the sum of its proper divisors (715290032).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
506631760 is a wasteful number, since it uses less digits than its factorization.
506631760 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1052 (or 1046 counting only the distinct ones).
The product of its (nonzero) digits is 22680, while the sum is 34.
The square root of 506631760 is about 22508.4819568091. The cubic root of 506631760 is about 797.1942126175.
The spelling of 506631760 in words is "five hundred six million, six hundred thirty-one thousand, seven hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •