Search a number
-
+
156520020136 = 23171150882501
BaseRepresentation
bin1001000111000101010…
…0011111100010101000
3112222000011000212001211
42101301110133202220
510031023111121021
6155523155122504
714210466135214
oct2216124374250
9488004025054
10156520020136
116041a51a847
12264022a3434
13119b52bc93c
14780b687944
1541111d73e1
hex247151f8a8

156520020136 has 16 divisors (see below), whose sum is σ = 310738275540. Its totient is φ = 73656480000.

The previous prime is 156520020133. The next prime is 156520020149. The reversal of 156520020136 is 631020025651.

It can be written as a sum of positive squares in 2 ways, for example, as 151403479236 + 5116540900 = 389106^2 + 71530^2 .

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

It is not an unprimeable number, because it can be changed into a prime (156520020133) 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 3 ways as a sum of consecutive naturals, for example, 575441115 + ... + 575441386.

Almost surely, 2156520020136 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 1150882524 (or 1150882520 counting only the distinct ones).

The product of its (nonzero) digits is 10800, while the sum is 31.

Adding to 156520020136 its reverse (631020025651), we get a palindrome (787540045787).

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

Divisors: 1 2 4 8 17 34 68 136 1150882501 2301765002 4603530004 9207060008 19565002517 39130005034 78260010068 156520020136