Search a number
-
+
156936331 = 301152121
BaseRepresentation
bin10010101101010…
…10100010001011
3101221022012011201
421112222202023
5310133430311
623323405031
73613636216
oct1126524213
9357265151
10156936331
118064a652
1244683777
132668a146
1416bb277d
15db9e9c1
hex95aa88b

156936331 has 4 divisors (see below), whose sum is σ = 156991464. Its totient is φ = 156881200.

The previous prime is 156936323. The next prime is 156936343. The reversal of 156936331 is 133639651.

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 156936331 - 23 = 156936323 is a prime.

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

It is a Duffinian number.

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

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

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

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

Almost surely, 2156936331 is an apocalyptic number.

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

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

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

The sum of its prime factors is 55132.

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

The square root of 156936331 is about 12527.4231588144. The cubic root of 156936331 is about 539.3961368153.

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

Divisors: 1 3011 52121 156936331