Search a number
-
+
530111111 = 9713939317
BaseRepresentation
bin11111100110001…
…101101010000111
31100221111102201212
4133212031222013
52041202023421
6124334042035
716064604305
oct3746155207
91327442655
10530111111
11252263362
1212964931b
1385a9881a
1450593275
1531814e5b
hex1f98da87

530111111 has 8 divisors (see below), whose sum is σ = 539442960. Its totient is φ = 520858368.

The previous prime is 530111089. The next prime is 530111143. The reversal of 530111111 is 111111035.

It is a sphenic number, since it is the product of 3 distinct primes.

It is a cyclic number.

It is not a de Polignac number, because 530111111 - 214 = 530094727 is a prime.

It is a Duffinian number.

530111111 is a modest number, since divided by 11111 gives 5301 as remainder.

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (530111011) 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 7 ways as a sum of consecutive naturals, for example, 6176 + ... + 33141.

It is an arithmetic number, because the mean of its divisors is an integer number (67430370).

Almost surely, 2530111111 is an apocalyptic number.

530111111 is a deficient number, since it is larger than the sum of its proper divisors (9331849).

530111111 is a wasteful number, since it uses less digits than its factorization.

530111111 is an odious number, because the sum of its binary digits is odd.

The sum of its prime factors is 39553.

The product of its (nonzero) digits is 15, while the sum is 14.

The square root of 530111111 is about 23024.1419166926. The cubic root of 530111111 is about 809.3237820156.

Adding to 530111111 its reverse (111111035), we get a palindrome (641222146).

The spelling of 530111111 in words is "five hundred thirty million, one hundred eleven thousand, one hundred eleven".

Divisors: 1 97 139 13483 39317 3813749 5465063 530111111