Base | Representation |
---|---|
bin | 11111011111111… |
… | …111111100000100 |
3 | 1100211102200002100 |
4 | 133133333330010 |
5 | 2040242411202 |
6 | 124235112100 |
7 | 16045011000 |
oct | 3737777404 |
9 | 1324380070 |
10 | 528482052 |
11 | 25135042a |
12 | 128ba2630 |
13 | 85648197 |
14 | 5028b700 |
15 | 315e241c |
hex | 1f7fff04 |
528482052 has 144 divisors (see below), whose sum is σ = 1574809600. Its totient is φ = 149361408.
The previous prime is 528482029. The next prime is 528482069. The reversal of 528482052 is 250284825.
528482052 is a `hidden beast` number, since 528 + 4 + 82 + 0 + 52 = 666.
It is a super-2 number, since 2×5284820522 = 558586558572261408, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a junction number, because it is equal to n+sod(n) for n = 528481998 and 528482016.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 1568028 + ... + 1568364.
Almost surely, 2528482052 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 528482052, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (787404800).
528482052 is an abundant number, since it is smaller than the sum of its proper divisors (1046327548).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
528482052 is a wasteful number, since it uses less digits than its factorization.
528482052 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 495 (or 476 counting only the distinct ones).
The product of its (nonzero) digits is 51200, while the sum is 36.
The square root of 528482052 is about 22988.7375033950. The cubic root of 528482052 is about 808.4938999933.
The spelling of 528482052 in words is "five hundred twenty-eight million, four hundred eighty-two thousand, fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •