Search a number
-
+
155065141 = 7112013833
BaseRepresentation
bin10010011111000…
…01101100110101
3101210210010101101
421033201230311
5304144041031
623215330101
73562013650
oct1117415465
9353703341
10155065141
117a591810
1243b20931
132618352a
1416846897
15d930361
hex93e1b35

155065141 has 8 divisors (see below), whose sum is σ = 193328064. Its totient is φ = 120829920.

The previous prime is 155065139. The next prime is 155065159. The reversal of 155065141 is 141560551.

It is a happy number.

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 155065141 - 21 = 155065139 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 (155065171) 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, 1006840 + ... + 1006993.

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

Almost surely, 2155065141 is an apocalyptic number.

155065141 is a gapful number since it is divisible by the number (11) formed by its first and last digit.

It is an amenable number.

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

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

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

The sum of its prime factors is 2013851.

The product of its (nonzero) digits is 3000, while the sum is 28.

The square root of 155065141 is about 12452.5154486955. The cubic root of 155065141 is about 537.2437759134.

The spelling of 155065141 in words is "one hundred fifty-five million, sixty-five thousand, one hundred forty-one".

Divisors: 1 7 11 77 2013833 14096831 22152163 155065141