Base | Representation |
---|---|
bin | 11111101010100… |
… | …001111000011101 |
3 | 1101000121220202002 |
4 | 133222201320131 |
5 | 2041444230100 |
6 | 124414212045 |
7 | 16110326012 |
oct | 3752417035 |
9 | 1330556662 |
10 | 531242525 |
11 | 252966410 |
12 | 129ab4025 |
13 | 860a37b8 |
14 | 507a9709 |
15 | 3198a2d5 |
hex | 1faa1e1d |
531242525 has 24 divisors (see below), whose sum is σ = 719712864. Its totient is φ = 385774400.
The previous prime is 531242521. The next prime is 531242539. The reversal of 531242525 is 525242135.
It is not a de Polignac number, because 531242525 - 22 = 531242521 is a prime.
It is a hoax number, since the sum of its digits (29) coincides with the sum of the digits of its distinct prime factors.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (531242521) 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 23 ways as a sum of consecutive naturals, for example, 277622 + ... + 279528.
It is an arithmetic number, because the mean of its divisors is an integer number (29988036).
Almost surely, 2531242525 is an apocalyptic number.
531242525 is a gapful number since it is divisible by the number (55) formed by its first and last digit.
It is an amenable number.
531242525 is a deficient number, since it is larger than the sum of its proper divisors (188470339).
531242525 is a wasteful number, since it uses less digits than its factorization.
531242525 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2941 (or 2936 counting only the distinct ones).
The product of its digits is 12000, while the sum is 29.
The square root of 531242525 is about 23048.6989871446. The cubic root of 531242525 is about 809.8991516979.
The spelling of 531242525 in words is "five hundred thirty-one million, two hundred forty-two thousand, five hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •