Search a number
-
+
156501140625331 = 13611117110293601
BaseRepresentation
bin100011100101011001000010…
…111001001101011110110011
3202112010100210120111211100221
4203211121002321031132303
5131003103314000002311
61312503344221553511
744651556105251425
oct4345310271153663
9675110716454327
10156501140625331
11459588409a7877
1215676b77415897
136942cc044c7b8
142a909a4b04815
151315e49208671
hex8e5642e4d7b3

156501140625331 has 8 divisors (see below), whose sum is σ = 156630165542928. Its totient is φ = 156372136320000.

The previous prime is 156501140625329. The next prime is 156501140625373. The reversal of 156501140625331 is 133526041105651.

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 156501140625331 - 21 = 156501140625329 is a prime.

It is a super-2 number, since 2×1565011406253312 (a number of 29 digits) contains 22 as substring.

It is a Duffinian number.

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

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

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

Almost surely, 2156501140625331 is an apocalyptic number.

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

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

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

The sum of its prime factors is 10306133.

The product of its (nonzero) digits is 324000, while the sum is 43.

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

Divisors: 1 1361 11171 10293601 15203731 14009590961 114989816771 156501140625331