Base | Representation |
---|---|
bin | 11111100101111… |
… | …001011000010101 |
3 | 1100221100012210122 |
4 | 133211321120111 |
5 | 2041141344203 |
6 | 124332201325 |
7 | 16064110202 |
oct | 3745713025 |
9 | 1327305718 |
10 | 530028053 |
11 | 252206a15 |
12 | 129609245 |
13 | 85a69a89 |
14 | 50570ca9 |
15 | 317ea538 |
hex | 1f979615 |
530028053 has 4 divisors (see below), whose sum is σ = 530104140. Its totient is φ = 529951968.
The previous prime is 530028043. The next prime is 530028067. The reversal of 530028053 is 350820035.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 477291409 + 52736644 = 21847^2 + 7262^2 .
It is a cyclic number.
It is not a de Polignac number, because 530028053 - 226 = 462919189 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (530028043) 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 3 ways as a sum of consecutive naturals, for example, 26408 + ... + 41921.
It is an arithmetic number, because the mean of its divisors is an integer number (132526035).
Almost surely, 2530028053 is an apocalyptic number.
It is an amenable number.
530028053 is a deficient number, since it is larger than the sum of its proper divisors (76087).
530028053 is an equidigital number, since it uses as much as digits as its factorization.
530028053 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 76086.
The product of its (nonzero) digits is 3600, while the sum is 26.
The square root of 530028053 is about 23022.3381306070. The cubic root of 530028053 is about 809.2815114272.
Adding to 530028053 its reverse (350820035), we get a palindrome (880848088).
The spelling of 530028053 in words is "five hundred thirty million, twenty-eight thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •