Base | Representation |
---|---|
bin | 10010101110000… |
… | …01111011001011 |
3 | 101221111001121011 |
4 | 21113001323023 |
5 | 310200012024 |
6 | 23325424351 |
7 | 3614515435 |
oct | 1127017313 |
9 | 357431534 |
10 | 157032139 |
11 | 80705630 |
12 | 4470b0b7 |
13 | 266c1934 |
14 | 16bd9655 |
15 | dbbd094 |
hex | 95c1ecb |
157032139 has 4 divisors (see below), whose sum is σ = 171307800. Its totient is φ = 142756480.
The previous prime is 157032137. The next prime is 157032149. The reversal of 157032139 is 931230751.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 157032139 - 21 = 157032137 is a prime.
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 157032139.
It is not an unprimeable number, because it can be changed into a prime (157032133) 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, 7137814 + ... + 7137835.
It is an arithmetic number, because the mean of its divisors is an integer number (42826950).
Almost surely, 2157032139 is an apocalyptic number.
157032139 is a deficient number, since it is larger than the sum of its proper divisors (14275661).
157032139 is a wasteful number, since it uses less digits than its factorization.
157032139 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14275660.
The product of its (nonzero) digits is 5670, while the sum is 31.
The square root of 157032139 is about 12531.2465062339. The cubic root of 157032139 is about 539.5058797323.
The spelling of 157032139 in words is "one hundred fifty-seven million, thirty-two thousand, one hundred thirty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •