Search a number
-
+
153204050032 = 2411870477557
BaseRepresentation
bin1000111010101110101…
…1000100100001110000
3112122110001110010020021
42032223223010201300
510002230214100112
6154214142253224
714032352636665
oct2165353044160
9478401403207
10153204050032
1159a78768390
1225837887214
13115a7308557
1475b5111a6c
153eba02c907
hex23abac4870

153204050032 has 20 divisors (see below), whose sum is σ = 323817651576. Its totient is φ = 69638204480.

The previous prime is 153204050017. The next prime is 153204050039. The reversal of 153204050032 is 230050402351.

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

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (153204050039) 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, 435238603 + ... + 435238954.

Almost surely, 2153204050032 is an apocalyptic number.

It is an amenable number.

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

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

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

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

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

The product of its (nonzero) digits is 3600, while the sum is 25.

Adding to 153204050032 its reverse (230050402351), we get a palindrome (383254452383).

The spelling of 153204050032 in words is "one hundred fifty-three billion, two hundred four million, fifty thousand, thirty-two".

Divisors: 1 2 4 8 11 16 22 44 88 176 870477557 1740955114 3481910228 6963820456 9575253127 13927640912 19150506254 38301012508 76602025016 153204050032