Search a number
-
+
530322331111 = 2323057492657
BaseRepresentation
bin1111011011110011010…
…11001001010111100111
31212200212002000201202221
413231321223021113213
532142100004043421
61043343212013211
753212611303136
oct7557153112747
91780762021687
10530322331111
111949aa148681
1286943a61207
133b01722c131
141b94c3b591d
15dbdcbcc841
hex7b79ac95e7

530322331111 has 4 divisors (see below), whose sum is σ = 553379823792. Its totient is φ = 507264838432.

The previous prime is 530322331093. The next prime is 530322331117. The reversal of 530322331111 is 111133223035.

It is a semiprime because it is the product of two primes.

It is a cyclic number.

It is not a de Polignac number, because 530322331111 - 213 = 530322322919 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 (530322331117) by changing a digit.

It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 11528746306 + ... + 11528746351.

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

Almost surely, 2530322331111 is an apocalyptic number.

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

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

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

The sum of its prime factors is 23057492680.

The product of its (nonzero) digits is 1620, while the sum is 25.

Adding to 530322331111 its reverse (111133223035), we get a palindrome (641455554146).

The spelling of 530322331111 in words is "five hundred thirty billion, three hundred twenty-two million, three hundred thirty-one thousand, one hundred eleven".

Divisors: 1 23 23057492657 530322331111