Search a number
-
+
157049551 = 791987969
BaseRepresentation
bin10010101110001…
…10001011001111
3101221111221111001
421113012023033
5310201041201
623330041131
73614620261
oct1127061317
9357457431
10157049551
118071771a
12447191a7
13266c9839
1416c01b31
15dbc3301
hex95c62cf

157049551 has 4 divisors (see below), whose sum is σ = 159037600. Its totient is φ = 155061504.

The previous prime is 157049521. The next prime is 157049561. The reversal of 157049551 is 155940751.

It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 155940751 = 277562963.

It is a cyclic number.

It is not a de Polignac number, because 157049551 - 219 = 156525263 is a prime.

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

It is a Duffinian number.

It is a self number, because there is not a number n which added to its sum of digits gives 157049551.

It is a congruent number.

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

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

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

Almost surely, 2157049551 is an apocalyptic number.

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

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

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

The sum of its prime factors is 1988048.

The product of its (nonzero) digits is 31500, while the sum is 37.

The square root of 157049551 is about 12531.9412303122. The cubic root of 157049551 is about 539.5258194492.

The spelling of 157049551 in words is "one hundred fifty-seven million, forty-nine thousand, five hundred fifty-one".

Divisors: 1 79 1987969 157049551