Base | Representation |
---|---|
bin | 10010101110001… |
… | …01100101111111 |
3 | 101221111211012202 |
4 | 21113011211333 |
5 | 310201002132 |
6 | 23330022115 |
7 | 3614610314 |
oct | 1127054577 |
9 | 357454182 |
10 | 157047167 |
11 | 80715952 |
12 | 4471793b |
13 | 266c8724 |
14 | 16c00d0b |
15 | dbc2762 |
hex | 95c597f |
157047167 has 4 divisors (see below), whose sum is σ = 157259280. Its totient is φ = 156835056.
The previous prime is 157047127. The next prime is 157047169. The reversal of 157047167 is 761740751.
It is a happy number.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 761740751 = 53 ⋅14372467.
It is a cyclic number.
It is not a de Polignac number, because 157047167 - 218 = 156785023 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 157047167.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (157047169) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 104942 + ... + 106427.
It is an arithmetic number, because the mean of its divisors is an integer number (39314820).
Almost surely, 2157047167 is an apocalyptic number.
157047167 is a deficient number, since it is larger than the sum of its proper divisors (212113).
157047167 is an equidigital number, since it uses as much as digits as its factorization.
157047167 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 212112.
The product of its (nonzero) digits is 41160, while the sum is 38.
The square root of 157047167 is about 12531.8461130035. The cubic root of 157047167 is about 539.5230894487.
The spelling of 157047167 in words is "one hundred fifty-seven million, forty-seven thousand, one hundred sixty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.001 sec. • engine limits •