Base | Representation |
---|---|
bin | 11111100101111… |
… | …111111101110011 |
3 | 1100221101120210200 |
4 | 133211333331303 |
5 | 2041143230102 |
6 | 124332530243 |
7 | 16064251635 |
oct | 3745777563 |
9 | 1327346720 |
10 | 530055027 |
11 | 252225207 |
12 | 129620983 |
13 | 85a79138 |
14 | 5057aa55 |
15 | 3180351c |
hex | 1f97ff73 |
530055027 has 24 divisors (see below), whose sum is σ = 808604160. Its totient is φ = 333661680.
The previous prime is 530055017. The next prime is 530055037. The reversal of 530055027 is 720550035.
It is an interprime number because it is at equal distance from previous prime (530055017) and next prime (530055037).
It is not a de Polignac number, because 530055027 - 212 = 530050931 is a prime.
It is a super-4 number, since 4×5300550274 (a number of 36 digits) contains 4444 as substring.
It is not an unprimeable number, because it can be changed into a prime (530055017) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 48198 + ... + 58164.
It is an arithmetic number, because the mean of its divisors is an integer number (33691840).
Almost surely, 2530055027 is an apocalyptic number.
530055027 is a gapful number since it is divisible by the number (57) formed by its first and last digit.
530055027 is a deficient number, since it is larger than the sum of its proper divisors (278549133).
530055027 is a wasteful number, since it uses less digits than its factorization.
530055027 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10303 (or 10300 counting only the distinct ones).
The product of its (nonzero) digits is 5250, while the sum is 27.
The square root of 530055027 is about 23022.9239454940. The cubic root of 530055027 is about 809.2952397503.
The spelling of 530055027 in words is "five hundred thirty million, fifty-five thousand, twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •