Search a number
-
+
150657007771071 = 3228807581097217
BaseRepresentation
bin100010010000010110010001…
…011011100101110110111111
3201202102200001220111200020100
4202100112101123211312333
5124221331022442133241
61252230512432452143
743506416045520534
oct4220262133456677
9652380056450210
10150657007771071
11440053072a2a4a
1214a924070aa053
13660ab83060229
14292bba39b0d8b
151263e03e939b6
hex8905916e5dbf

150657007771071 has 12 divisors (see below), whose sum is σ = 217623232529872. Its totient is φ = 100434518424576.

The previous prime is 150657007770977. The next prime is 150657007771091. The reversal of 150657007771071 is 170177700756051.

150657007771071 is a `hidden beast` number, since 1 + 50 + 6 + 570 + 0 + 7 + 7 + 7 + 10 + 7 + 1 = 666.

It is not a de Polignac number, because 150657007771071 - 210 = 150657007770047 is a prime.

It is a Duffinian number.

It is a junction number, because it is equal to n+sod(n) for n = 150657007770999 and 150657007771017.

It is a congruent number.

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

It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 290289346 + ... + 290807871.

Almost surely, 2150657007771071 is an apocalyptic number.

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

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

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

The sum of its prime factors is 581126030 (or 581126027 counting only the distinct ones).

The product of its (nonzero) digits is 2521050, while the sum is 54.

The spelling of 150657007771071 in words is "one hundred fifty trillion, six hundred fifty-seven billion, seven million, seven hundred seventy-one thousand, seventy-one".

Divisors: 1 3 9 28807 86421 259263 581097217 1743291651 5229874953 16739667530119 50219002590357 150657007771071