Search a number
-
+
155085931141 = 2910771496499
BaseRepresentation
bin1001000001101111010…
…1111000001010000101
3112211022012112120210121
42100123311320022011
510020103444244031
6155125005421541
714130113443561
oct2203365701205
9484265476717
10155085931141
115a853a68529
1226081b6a8b1
1311817166c7b
1477130206a1
15407a35c011
hex241bd78285

155085931141 has 8 divisors (see below), whose sum is σ = 160448940000. Its totient is φ = 149723936880.

The previous prime is 155085931139. The next prime is 155085931157. The reversal of 155085931141 is 141139580551.

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 155085931141 - 21 = 155085931139 is a prime.

It is a Duffinian number.

It is a congruent number.

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

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

Almost surely, 2155085931141 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 507299.

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

The spelling of 155085931141 in words is "one hundred fifty-five billion, eighty-five million, nine hundred thirty-one thousand, one hundred forty-one".

Divisors: 1 29 10771 312359 496499 14398471 5347790729 155085931141