Base | Representation |
---|---|
bin | 11111011110001… |
… | …010110000010000 |
3 | 1100210112021200000 |
4 | 133132022300100 |
5 | 2040132031224 |
6 | 124220530000 |
7 | 16040641422 |
oct | 3736126020 |
9 | 1323467600 |
10 | 528002064 |
11 | 251052847 |
12 | 1289b0900 |
13 | 8550a875 |
14 | 501a4812 |
15 | 3154a0c9 |
hex | 1f78ac10 |
528002064 has 120 divisors (see below), whose sum is σ = 1545005280. Its totient is φ = 174555648.
The previous prime is 528002047. The next prime is 528002071. The reversal of 528002064 is 460200825.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 539944 + ... + 540920.
It is an arithmetic number, because the mean of its divisors is an integer number (12875044).
Almost surely, 2528002064 is an apocalyptic number.
528002064 is a gapful number since it is divisible by the number (54) 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 528002064, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (772502640).
528002064 is an abundant number, since it is smaller than the sum of its proper divisors (1017003216).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
528002064 is a wasteful number, since it uses less digits than its factorization.
528002064 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1139 (or 1121 counting only the distinct ones).
The product of its (nonzero) digits is 3840, while the sum is 27.
The square root of 528002064 is about 22978.2954981435. The cubic root of 528002064 is about 808.2490572947.
Adding to 528002064 its reverse (460200825), we get a palindrome (988202889).
The spelling of 528002064 in words is "five hundred twenty-eight million, two thousand, sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •