Search a number
-
+
155221150151 = 4122727760209
BaseRepresentation
bin1001000010001111100…
…1101100100111000111
3112211122121222102102002
42100203321230213013
510020343103301101
6155150235535515
714133345002234
oct2204371544707
9484577872362
10155221150151
115a913324581
12260bb2ba59b
131183918c112
147726d7c78b
15408716bd6b
hex2423e6c9c7

155221150151 has 16 divisors (see below), whose sum is σ = 160286726880. Its totient is φ = 150221368320.

The previous prime is 155221150121. The next prime is 155221150169. The reversal of 155221150151 is 151051122551.

155221150151 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-155221150151 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 (155221150121) by changing a digit.

It is a pernicious number, because its binary representation contains a prime number (19) of ones.

It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2547935 + ... + 2608143.

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

Almost surely, 2155221150151 is an apocalyptic number.

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

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

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

The sum of its prime factors is 60754.

The product of its (nonzero) digits is 2500, while the sum is 29.

The spelling of 155221150151 in words is "one hundred fifty-five billion, two hundred twenty-one million, one hundred fifty thousand, one hundred fifty-one".

Divisors: 1 41 227 277 9307 11357 60209 62879 2468569 2578039 13667443 16677893 560365163 683793613 3785881711 155221150151