Search a number
-
+
150520052232035 = 5234013326157493
BaseRepresentation
bin100010001110010110101110…
…001111101010111101100011
3201201221120120020111102210122
4202032112232033222331203
5124212110031332411120
61252043542444150455
743463500132611653
oct4216265617527543
9651846506442718
10150520052232035
1143a62217487452
1214a6b964b3842b
1365cac9814b935
1429252d0840363
15126058a699a25
hex88e5ae3eaf63

150520052232035 has 16 divisors (see below), whose sum is σ = 188524250051904. Its totient is φ = 115151859495552.

The previous prime is 150520052231911. The next prime is 150520052232157. The reversal of 150520052232035 is 530232250025051.

It is a cyclic number.

It is not a de Polignac number, because 150520052232035 - 218 = 150520051969891 is a prime.

It is a super-2 number, since 2×1505200522320352 (a number of 29 digits) contains 22 as substring.

It is a Duffinian number.

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

It is an unprimeable number.

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

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

Almost surely, 2150520052232035 is an apocalyptic number.

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

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

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

The sum of its prime factors is 326161534.

The product of its (nonzero) digits is 90000, while the sum is 35.

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

Divisors: 1 5 23 115 4013 20065 92299 461495 326157493 1630787465 7501622339 37508111695 1308870019409 6544350097045 30104010446407 150520052232035