Search a number
-
+
156425631 = 353983809
BaseRepresentation
bin10010101001011…
…01110110011111
3101220100020121220
421110231312133
5310021110011
623304424423
73606411255
oct1124556637
9356306556
10156425631
118033098a
1244478113
132653b85b
1416abc5d5
15daed506
hex952dd9f

156425631 has 8 divisors (see below), whose sum is σ = 212502960. Its totient is φ = 102316032.

The previous prime is 156425611. The next prime is 156425663. The reversal of 156425631 is 136524651.

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

It is not a de Polignac number, because 156425631 - 211 = 156423583 is a prime.

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

It is a junction number, because it is equal to n+sod(n) for n = 156425592 and 156425601.

It is a congruent number.

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

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

Almost surely, 2156425631 is an apocalyptic number.

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

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

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

The sum of its prime factors is 983865.

The product of its digits is 21600, while the sum is 33.

The square root of 156425631 is about 12507.0232669489. The cubic root of 156425631 is about 538.8104025529.

The spelling of 156425631 in words is "one hundred fifty-six million, four hundred twenty-five thousand, six hundred thirty-one".

Divisors: 1 3 53 159 983809 2951427 52141877 156425631