Base | Representation |
---|---|
bin | 11111100110101… |
… | …110011011010100 |
3 | 1100221202020212000 |
4 | 133212232123110 |
5 | 2041220322312 |
6 | 124340555300 |
7 | 16066003521 |
oct | 3746563324 |
9 | 1327666760 |
10 | 530245332 |
11 | 252345191 |
12 | 1296b2b30 |
13 | 85b14946 |
14 | 505ca148 |
15 | 3183eadc |
hex | 1f9ae6d4 |
530245332 has 24 divisors (see below), whose sum is σ = 1374710400. Its totient is φ = 176748408.
The previous prime is 530245327. The next prime is 530245349. The reversal of 530245332 is 233542035.
It is a super-3 number, since 3×5302453323 (a number of 27 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a junction number, because it is equal to n+sod(n) for n = 530245296 and 530245305.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2454732 + ... + 2454947.
It is an arithmetic number, because the mean of its divisors is an integer number (57279600).
Almost surely, 2530245332 is an apocalyptic number.
It is an amenable number.
530245332 is an abundant number, since it is smaller than the sum of its proper divisors (844465068).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
530245332 is a wasteful number, since it uses less digits than its factorization.
530245332 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4909692 (or 4909684 counting only the distinct ones).
The product of its (nonzero) digits is 10800, while the sum is 27.
The square root of 530245332 is about 23027.0565205369. The cubic root of 530245332 is about 809.3920815842.
Adding to 530245332 its reverse (233542035), we get a palindrome (763787367).
The spelling of 530245332 in words is "five hundred thirty million, two hundred forty-five thousand, three hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •