Search a number
-
+
153050111435650 = 252111359887409027
BaseRepresentation
bin100010110011001011000001…
…100001100110001110000010
3202001220110002102020202110211
4202303023001201212032002
5130030033112011420100
61301302130041344334
744144335303164502
oct4263130141461602
9661813072222424
10153050111435650
1144848207996270
12151ba1787980aa
136752743254490
1429b194476da02
1512a62b81cb1ba
hex8b32c1866382

153050111435650 has 192 divisors, whose sum is σ = 340494016988160. Its totient is φ = 50445667411200.

The previous prime is 153050111435633. The next prime is 153050111435699. The reversal of 153050111435650 is 56534111050351.

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

It is an unprimeable number.

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 95 ways as a sum of consecutive naturals, for example, 373976437 + ... + 374385463.

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

Almost surely, 2153050111435650 is an apocalyptic number.

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

153050111435650 is an abundant number, since it is smaller than the sum of its proper divisors (187443905552510).

It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.

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

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

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

The product of its (nonzero) digits is 135000, while the sum is 40.

The spelling of 153050111435650 in words is "one hundred fifty-three trillion, fifty billion, one hundred eleven million, four hundred thirty-five thousand, six hundred fifty".