Base | Representation |
---|---|
bin | 10010101111011… |
… | …10110110001101 |
3 | 101221211102000001 |
4 | 21113232312031 |
5 | 310221404031 |
6 | 23333404301 |
7 | 3616213045 |
oct | 1127566615 |
9 | 357742001 |
10 | 157216141 |
11 | 808208a5 |
12 | 44799691 |
13 | 26757604 |
14 | 16c46725 |
15 | dc07861 |
hex | 95eed8d |
157216141 has 2 divisors, whose sum is σ = 157216142. Its totient is φ = 157216140.
The previous prime is 157216139. The next prime is 157216151. The reversal of 157216141 is 141612751.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 98922916 + 58293225 = 9946^2 + 7635^2 .
It is a cyclic number.
It is not a de Polignac number, because 157216141 - 21 = 157216139 is a prime.
Together with 157216139, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (157216121) 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, 78608070 + 78608071.
It is an arithmetic number, because the mean of its divisors is an integer number (78608071).
Almost surely, 2157216141 is an apocalyptic number.
It is an amenable number.
157216141 is a deficient number, since it is larger than the sum of its proper divisors (1).
157216141 is an equidigital number, since it uses as much as digits as its factorization.
157216141 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 1680, while the sum is 28.
The square root of 157216141 is about 12538.5860845631. The cubic root of 157216141 is about 539.7165190183.
Adding to 157216141 its reverse (141612751), we get a palindrome (298828892).
The spelling of 157216141 in words is "one hundred fifty-seven million, two hundred sixteen thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •