Search a number
-
+
152056732 = 22233163151
BaseRepresentation
bin10010001000000…
…11001110011100
3101121010021121211
421010003032130
5302411303412
623031034204
73524314042
oct1104031634
9347107554
10152056732
1178917523
1242b0b964
132566c0c9
14162a2392
15d538ca7
hex910339c

152056732 has 12 divisors (see below), whose sum is σ = 267242976. Its totient is φ = 75701600.

The previous prime is 152056699. The next prime is 152056757. The reversal of 152056732 is 237650251.

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

It is a congruent number.

It is an unprimeable number.

It is a pernicious number, because its binary representation contains a prime number (11) of ones.

It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 80644 + ... + 82507.

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

Almost surely, 2152056732 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The product of its (nonzero) digits is 12600, while the sum is 31.

The square root of 152056732 is about 12331.1285777093. The cubic root of 152056732 is about 533.7467178726.

The spelling of 152056732 in words is "one hundred fifty-two million, fifty-six thousand, seven hundred thirty-two".

Divisors: 1 2 4 233 466 932 163151 326302 652604 38014183 76028366 152056732