Search a number
-
+
530161 = 1513511
BaseRepresentation
bin10000001011011110001
3222221020121
42001123301
5113431121
615210241
74335442
oct2013361
9887217
10530161
11332355
12216981
13157408
14db2c9
15a7141
hex816f1

530161 has 4 divisors (see below), whose sum is σ = 533824. Its totient is φ = 526500.

The previous prime is 530143. The next prime is 530177. The reversal of 530161 is 161035.

It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.

It is a cyclic number.

It is not a de Polignac number, because 530161 - 25 = 530129 is a prime.

It is a Duffinian number.

It is not an unprimeable number, because it can be changed into a prime (530261) 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, 1605 + ... + 1906.

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

2530161 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 3662.

The product of its (nonzero) digits is 90, while the sum is 16.

The square root of 530161 is about 728.1215557858. The cubic root of 530161 is about 80.9349169830.

Adding to 530161 its reverse (161035), we get a palindrome (691196).

The spelling of 530161 in words is "five hundred thirty thousand, one hundred sixty-one".

Divisors: 1 151 3511 530161