Base | Representation |
---|---|
bin | 10010101111000… |
… | …01000001101011 |
3 | 101221201112100101 |
4 | 21113201001223 |
5 | 310213101111 |
6 | 23332250231 |
7 | 3615556024 |
oct | 1127410153 |
9 | 357645311 |
10 | 157159531 |
11 | 80792311 |
12 | 44770977 |
13 | 26737909 |
14 | 16c2dc4b |
15 | dbe5bc1 |
hex | 95e106b |
157159531 has 4 divisors (see below), whose sum is σ = 157185000. Its totient is φ = 157134064.
The previous prime is 157159523. The next prime is 157159537. The reversal of 157159531 is 135951751.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length, and also an emirpimes, since its reverse is a distinct semiprime: 135951751 = 13 ⋅10457827.
It is a cyclic number.
It is not a de Polignac number, because 157159531 - 23 = 157159523 is a prime.
It is a super-2 number, since 2×1571595312 = 49398236368279922, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (157159537) 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 3 ways as a sum of consecutive naturals, for example, 3015 + ... + 17983.
It is an arithmetic number, because the mean of its divisors is an integer number (39296250).
Almost surely, 2157159531 is an apocalyptic number.
157159531 is a deficient number, since it is larger than the sum of its proper divisors (25469).
157159531 is a wasteful number, since it uses less digits than its factorization.
157159531 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 25468.
The product of its digits is 23625, while the sum is 37.
The square root of 157159531 is about 12536.3284497496. The cubic root of 157159531 is about 539.6517313108.
The spelling of 157159531 in words is "one hundred fifty-seven million, one hundred fifty-nine thousand, five hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •