Search a number
-
+
152032507 = 1122354629
BaseRepresentation
bin10010000111111…
…01010011111011
3101121002001101121
421003331103323
5302410020012
623030330111
73524153314
oct1103752373
9347061347
10152032507
1178900300
1242ab9937
1325661083
141629760b
15d531a07
hex90fd4fb

152032507 has 12 divisors (see below), whose sum is σ = 174378960. Its totient is φ = 132199760.

The previous prime is 152032499. The next prime is 152032541. The reversal of 152032507 is 705230251.

It is not a de Polignac number, because 152032507 - 23 = 152032499 is a prime.

It is a super-2 number, since 2×1520325072 = 46227766369410098, which contains 22 as substring.

It is a Duffinian number.

It is not an unprimeable number, because it can be changed into a prime (152032607) 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 11 ways as a sum of consecutive naturals, for example, 24532 + ... + 30097.

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

Almost surely, 2152032507 is an apocalyptic number.

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

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

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

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

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

The square root of 152032507 is about 12330.1462683944. The cubic root of 152032507 is about 533.7183716521.

Adding to 152032507 its reverse (705230251), we get a palindrome (857262758).

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

Divisors: 1 11 23 121 253 2783 54629 600919 1256467 6610109 13821137 152032507