Base | Representation |
---|---|
bin | 11111001111000… |
… | …110011000000000 |
3 | 1100112002121011011 |
4 | 133033012120000 |
5 | 2033124130333 |
6 | 124000130304 |
7 | 15662240206 |
oct | 3717063000 |
9 | 1315077134 |
10 | 524051968 |
11 | 2498a5000 |
12 | 127606994 |
13 | 8475692b |
14 | 4d857076 |
15 | 310199cd |
hex | 1f3c6600 |
524051968 has 80 divisors (see below), whose sum is σ = 1153207440. Its totient is φ = 237895680.
The previous prime is 524051947. The next prime is 524051971. The reversal of 524051968 is 869150425.
It is a zygodrome in base 2.
It is a self number, because there is not a number n which added to its sum of digits gives 524051968.
It is a congruent number.
It is an unprimeable number.
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 7 ways as a sum of consecutive naturals, for example, 681088 + ... + 681856.
It is an arithmetic number, because the mean of its divisors is an integer number (14415093).
Almost surely, 2524051968 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 524051968, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (576603720).
524051968 is an abundant number, since it is smaller than the sum of its proper divisors (629155472).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
524051968 is an frugal number, since it uses more digits than its factorization.
524051968 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 820 (or 782 counting only the distinct ones).
The product of its (nonzero) digits is 86400, while the sum is 40.
The square root of 524051968 is about 22892.1813726871. The cubic root of 524051968 is about 806.2284488521.
The spelling of 524051968 in words is "five hundred twenty-four million, fifty-one thousand, nine hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •