Search a number
-
+
151502032532 = 22234716137839
BaseRepresentation
bin1000110100011000111…
…0011000111010010100
3112111001102210200011002
42031012032120322110
54440234010020112
6153333222202432
713642235012564
oct2150616307224
9474042720132
10151502032532
1159284a47454
1225441883418
13113958038c6
147493062da4
153e1a8cb1c2
hex2346398e94

151502032532 has 12 divisors (see below), whose sum is σ = 265241538240. Its totient is φ = 75718735896.

The previous prime is 151502032523. The next prime is 151502032559. The reversal of 151502032532 is 235230205151.

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

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

It is a congruent number.

It is an unprimeable number.

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, 8059532 + ... + 8078307.

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

Almost surely, 2151502032532 is an apocalyptic number.

It is an amenable number.

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

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

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

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

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

Adding to 151502032532 its reverse (235230205151), we get a palindrome (386732237683).

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

Divisors: 1 2 4 2347 4694 9388 16137839 32275678 64551356 37875508133 75751016266 151502032532