Search a number
-
+
159906431 = 331587823
BaseRepresentation
bin10011000011111…
…11101001111111
3102010220002101102
421201333221333
5311414001211
623511203315
73651116336
oct1141775177
9363802342
10159906431
1182299083
124567653b
1327189cb9
1417346d1d
15e089a3b
hex987fa7f

159906431 has 8 divisors (see below), whose sum is σ = 160857984. Its totient is φ = 158958360.

The previous prime is 159906407. The next prime is 159906443. The reversal of 159906431 is 134609951.

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

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-159906431 is a prime.

It is a super-2 number, since 2×1599064312 = 51140133350315522, which contains 22 as substring.

It is a Duffinian number.

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (159906491) by changing a digit.

It is a pernicious number, because its binary representation contains a prime number (19) of ones.

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 193886 + ... + 194708.

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

Almost surely, 2159906431 is an apocalyptic number.

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

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

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

The sum of its prime factors is 1741.

The product of its (nonzero) digits is 29160, while the sum is 38.

The square root of 159906431 is about 12645.4114602887. The cubic root of 159906431 is about 542.7776754570. Note that the first 3 decimals are identical.

The spelling of 159906431 in words is "one hundred fifty-nine million, nine hundred six thousand, four hundred thirty-one".

Divisors: 1 331 587 823 194297 272413 483101 159906431