Base | Representation |
---|---|
bin | 10010101110101… |
… | …00110100111111 |
3 | 101221121222210212 |
4 | 21113110310333 |
5 | 310210001232 |
6 | 23331223035 |
7 | 3615260246 |
oct | 1127246477 |
9 | 357558725 |
10 | 157109567 |
11 | 8075881a |
12 | 44747a7b |
13 | 2671ac54 |
14 | 16c1995d |
15 | dbd5eb2 |
hex | 95d4d3f |
157109567 has 2 divisors, whose sum is σ = 157109568. Its totient is φ = 157109566.
The previous prime is 157109551. The next prime is 157109569. The reversal of 157109567 is 765901751.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 157109567 - 24 = 157109551 is a prime.
Together with 157109569, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (157109569) 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 as a sum of consecutive naturals, namely, 78554783 + 78554784.
It is an arithmetic number, because the mean of its divisors is an integer number (78554784).
Almost surely, 2157109567 is an apocalyptic number.
157109567 is a deficient number, since it is larger than the sum of its proper divisors (1).
157109567 is an equidigital number, since it uses as much as digits as its factorization.
157109567 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 66150, while the sum is 41.
The square root of 157109567 is about 12534.3355228748. The cubic root of 157109567 is about 539.5945367374.
The spelling of 157109567 in words is "one hundred fifty-seven million, one hundred nine thousand, five hundred sixty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •