Search a number
-
+
155114042151 = 351704680717
BaseRepresentation
bin1001000001110110000…
…1000111001100100111
3112211101011102202212010
42100131201013030213
510020133143322101
6155131452125303
714130604414065
oct2203541071447
9484334382763
10155114042151
115a868918772
122608b466833
131181cc2a1c3
147716a5b035
15407ca612d6
hex241d847327

155114042151 has 4 divisors (see below), whose sum is σ = 206818722872. Its totient is φ = 103409361432.

The previous prime is 155114042131. The next prime is 155114042203. The reversal of 155114042151 is 151240411551.

It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 151240411551 = 350413470517.

It is not a de Polignac number, because 155114042151 - 229 = 154577171239 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 (155114042131) 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, 25852340356 + ... + 25852340361.

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

Almost surely, 2155114042151 is an apocalyptic number.

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

155114042151 is an equidigital number, since it uses as much as digits as its factorization.

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

The sum of its prime factors is 51704680720.

The product of its (nonzero) digits is 4000, while the sum is 30.

The spelling of 155114042151 in words is "one hundred fifty-five billion, one hundred fourteen million, forty-two thousand, one hundred fifty-one".

Divisors: 1 3 51704680717 155114042151