Base | Representation |
---|---|
bin | 11111100110100… |
… | …111000101101000 |
3 | 1100221200201121200 |
4 | 133212213011220 |
5 | 2041213342042 |
6 | 124340204200 |
7 | 16065520056 |
oct | 3746470550 |
9 | 1327621550 |
10 | 530215272 |
11 | 252324644 |
12 | 129699660 |
13 | 85b04062 |
14 | 505bd1d6 |
15 | 31835c4c |
hex | 1f9a7168 |
530215272 has 48 divisors (see below), whose sum is σ = 1466562240. Its totient is φ = 172976928.
The previous prime is 530215271. The next prime is 530215277. The reversal of 530215272 is 272512035.
It is a super-2 number, since 2×5302152722 = 562256469324067968, which contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (530215271) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 74958 + ... + 81725.
It is an arithmetic number, because the mean of its divisors is an integer number (30553380).
Almost surely, 2530215272 is an apocalyptic number.
It is an amenable number.
530215272 is an abundant number, since it is smaller than the sum of its proper divisors (936346968).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
530215272 is a wasteful number, since it uses less digits than its factorization.
530215272 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 156742 (or 156735 counting only the distinct ones).
The product of its (nonzero) digits is 4200, while the sum is 27.
The square root of 530215272 is about 23026.4038008544. The cubic root of 530215272 is about 809.3767862833.
The spelling of 530215272 in words is "five hundred thirty million, two hundred fifteen thousand, two hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •