Search a number
-
+
159514561 = 315145631
BaseRepresentation
bin10011000000111…
…11111111000001
3102010011011211201
421200133333001
5311313431221
623454541201
73644565013
oct1140377701
9363134751
10159514561
1182050718
1245507801
132708081b
14172841b3
15e00d891
hex981ffc1

159514561 has 4 divisors (see below), whose sum is σ = 164660224. Its totient is φ = 154368900.

The previous prime is 159514549. The next prime is 159514567. The reversal of 159514561 is 165415951.

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 a de Polignac number, because none of the positive numbers 2k-159514561 is a prime.

It is a Duffinian number.

It is a self number, because there is not a number n which added to its sum of digits gives 159514561.

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

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

Almost surely, 2159514561 is an apocalyptic number.

It is an amenable number.

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

159514561 is an equidigital number, since it uses as much as digits as its factorization.

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

The sum of its prime factors is 5145662.

The product of its digits is 27000, while the sum is 37.

The square root of 159514561 is about 12629.9074026693. The cubic root of 159514561 is about 542.3339320526. Note that the first 3 decimals are identical.

The spelling of 159514561 in words is "one hundred fifty-nine million, five hundred fourteen thousand, five hundred sixty-one".

Divisors: 1 31 5145631 159514561