Search a number
-
+
157027050 = 23252348949
BaseRepresentation
bin10010101110000…
…00101011101010
3101221110210121200
421113000223222
5310144331200
623325345030
73614464545
oct1127005352
9357423550
10157027050
1180701824
1244708176
13266bc51b
1416bd785c
15dbbb800
hex95c0aea

157027050 has 36 divisors (see below), whose sum is σ = 421880550. Its totient is φ = 41873760.

The previous prime is 157027033. The next prime is 157027051. The reversal of 157027050 is 50720751.

It can be written as a sum of positive squares in 3 ways, for example, as 144937521 + 12089529 = 12039^2 + 3477^2 .

It is a nialpdrome in base 15.

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

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

It is a polite number, since it can be written in 17 ways as a sum of consecutive naturals, for example, 174025 + ... + 174924.

Almost surely, 2157027050 is an apocalyptic number.

157027050 is a gapful number since it is divisible by the number (10) formed by its first and last digit.

157027050 is an abundant number, since it is smaller than the sum of its proper divisors (264853500).

It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.

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

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

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

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

The square root of 157027050 is about 12531.0434521631. The cubic root of 157027050 is about 539.5000516789.

The spelling of 157027050 in words is "one hundred fifty-seven million, twenty-seven thousand, fifty".

Divisors: 1 2 3 5 6 9 10 15 18 25 30 45 50 75 90 150 225 450 348949 697898 1046847 1744745 2093694 3140541 3489490 5234235 6281082 8723725 10468470 15702705 17447450 26171175 31405410 52342350 78513525 157027050