Base | Representation |
---|---|
bin | 11111100110110… |
… | …000011101000000 |
3 | 1100221202200020102 |
4 | 133212300131000 |
5 | 2041221104012 |
6 | 124341101532 |
7 | 16066036646 |
oct | 3746603500 |
9 | 1327680212 |
10 | 530253632 |
11 | 252350447 |
12 | 1296b78a8 |
13 | 85b1865c |
14 | 505cd196 |
15 | 318422c2 |
hex | 1f9b0740 |
530253632 has 28 divisors (see below), whose sum is σ = 1088509380. Its totient is φ = 255983616.
The previous prime is 530253583. The next prime is 530253643. The reversal of 530253632 is 236352035.
It can be written as a sum of positive squares in 2 ways, for example, as 101929216 + 428324416 = 10096^2 + 20696^2 .
It is a Harshad number since it is a multiple of its sum of digits (29).
It is a junction number, because it is equal to n+sod(n) for n = 530253595 and 530253604.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 140993 + ... + 144704.
It is an arithmetic number, because the mean of its divisors is an integer number (38875335).
Almost surely, 2530253632 is an apocalyptic number.
It is an amenable number.
530253632 is an abundant number, since it is smaller than the sum of its proper divisors (558255748).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
530253632 is a wasteful number, since it uses less digits than its factorization.
530253632 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 285738 (or 285728 counting only the distinct ones).
The product of its (nonzero) digits is 16200, while the sum is 29.
The square root of 530253632 is about 23027.2367426055. The cubic root of 530253632 is about 809.3963047358.
The spelling of 530253632 in words is "five hundred thirty million, two hundred fifty-three thousand, six hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •