Search a number
-
+
156156710149 = 11108713059857
BaseRepresentation
bin1001000101101110101…
…0100100110100000101
3112221001211101210110101
42101123222210310011
510024302104211044
6155423140124101
714165465064346
oct2213352446405
9487054353411
10156156710149
1160253434660
1226320696631
1311957c5640b
1477b53140cd
1540de36ecd4
hex245baa4d05

156156710149 has 8 divisors (see below), whose sum is σ = 170509506048. Its totient is φ = 141830036160.

The previous prime is 156156710081. The next prime is 156156710183. The reversal of 156156710149 is 941017651651.

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

It is a cyclic number.

It is not a de Polignac number, because 156156710149 - 29 = 156156709637 is a prime.

It is a Duffinian number.

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

It is a congruent number.

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

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

Almost surely, 2156156710149 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 13060955.

The product of its (nonzero) digits is 226800, while the sum is 46.

The spelling of 156156710149 in words is "one hundred fifty-six billion, one hundred fifty-six million, seven hundred ten thousand, one hundred forty-nine".

Divisors: 1 11 1087 11957 13059857 143658427 14196064559 156156710149