Search a number
-
+
152615057 = 723114593
BaseRepresentation
bin10010001100010…
…11100010010001
3101122011122111112
421012023202101
5303032140212
623051023105
73532130600
oct1106134221
9348148445
10152615057
1179168a51
124313aa95
132580628a
14163a9a37
15d5e9422
hex918b891

152615057 has 6 divisors (see below), whose sum is σ = 177531858. Its totient is φ = 130812864.

The previous prime is 152615033. The next prime is 152615059. The reversal of 152615057 is 750516251.

It can be written as a sum of positive squares in only one way, i.e., 98386561 + 54228496 = 9919^2 + 7364^2 .

It is not a de Polignac number, because 152615057 - 26 = 152614993 is a prime.

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

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

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

Almost surely, 2152615057 is an apocalyptic number.

It is an amenable number.

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

152615057 is an equidigital number, since it uses as much as digits as its factorization.

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

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

The product of its (nonzero) digits is 10500, while the sum is 32.

The square root of 152615057 is about 12353.7466786396. The cubic root of 152615057 is about 534.3991939481.

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

Divisors: 1 7 49 3114593 21802151 152615057