Search a number
-
+
152920161 = 32291015801
BaseRepresentation
bin10010001110101…
…10000001100001
3101122202011000200
421013112001201
5303121421121
623101335413
73534541242
oct1107260141
9348664020
10152920161
11793571a9
1243267569
13258b2104
1416448cc9
15d659a26
hex91d6061

152920161 has 24 divisors (see below), whose sum is σ = 230803560. Its totient is φ = 97440000.

The previous prime is 152920129. The next prime is 152920177. The reversal of 152920161 is 161029251.

It can be written as a sum of positive squares in 4 ways, for example, as 111703761 + 41216400 = 10569^2 + 6420^2 .

It is not a de Polignac number, because 152920161 - 25 = 152920129 is a prime.

It is not an unprimeable number, because it can be changed into a prime (152920111) by changing a digit.

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 23 ways as a sum of consecutive naturals, for example, 23461 + ... + 29261.

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

Almost surely, 2152920161 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The product of its (nonzero) digits is 1080, while the sum is 27.

The square root of 152920161 is about 12366.0891554282. The cubic root of 152920161 is about 534.7550758252.

The spelling of 152920161 in words is "one hundred fifty-two million, nine hundred twenty thousand, one hundred sixty-one".

Divisors: 1 3 9 29 87 101 261 303 909 2929 5801 8787 17403 26361 52209 168229 504687 585901 1514061 1757703 5273109 16991129 50973387 152920161