Base | Representation |
---|---|
bin | 11111101001000… |
… | …100100000000001 |
3 | 1100222220111001201 |
4 | 133221010200001 |
5 | 2041400010113 |
6 | 124402101201 |
7 | 16104143614 |
oct | 3751044001 |
9 | 1328814051 |
10 | 530860033 |
11 | 252725000 |
12 | 12994a801 |
13 | 85c9b682 |
14 | 5070a17b |
15 | 31911cdd |
hex | 1fa44801 |
530860033 has 16 divisors (see below), whose sum is σ = 609328512. Its totient is φ = 461590800.
The previous prime is 530860021. The next prime is 530860049. The reversal of 530860033 is 330068035.
It is not a de Polignac number, because 530860033 - 221 = 528762881 is a prime.
It is a super-2 number, since 2×5308600332 = 563624749273522178, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 530859983 and 530860010.
It is not an unprimeable number, because it can be changed into a prime (530860093) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 21943 + ... + 39283.
It is an arithmetic number, because the mean of its divisors is an integer number (38083032).
Almost surely, 2530860033 is an apocalyptic number.
It is an amenable number.
530860033 is a deficient number, since it is larger than the sum of its proper divisors (78468479).
530860033 is a wasteful number, since it uses less digits than its factorization.
530860033 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17397 (or 17375 counting only the distinct ones).
The product of its (nonzero) digits is 6480, while the sum is 28.
The square root of 530860033 is about 23040.4000182289. The cubic root of 530860033 is about 809.7047305637.
It can be divided in two parts, 5308 and 60033, that added together give a triangular number (65341 = T361).
The spelling of 530860033 in words is "five hundred thirty million, eight hundred sixty thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.099 sec. • engine limits •