Base | Representation |
---|---|
bin | 10000111000110… |
… | …11011100001101 |
3 | 100212120120220212 |
4 | 20130123130031 |
5 | 242231421112 |
6 | 22020252205 |
7 | 3340114346 |
oct | 1034333415 |
9 | 325516825 |
10 | 141670157 |
11 | 72a72982 |
12 | 3b541065 |
13 | 234735c5 |
14 | 14b5b0cd |
15 | c686522 |
hex | 871b70d |
141670157 has 2 divisors, whose sum is σ = 141670158. Its totient is φ = 141670156.
The previous prime is 141670117. The next prime is 141670159. The reversal of 141670157 is 751076141.
141670157 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 135745801 + 5924356 = 11651^2 + 2434^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-141670157 is a prime.
Together with 141670159, 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 (141670159) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 70835078 + 70835079.
It is an arithmetic number, because the mean of its divisors is an integer number (70835079).
Almost surely, 2141670157 is an apocalyptic number.
It is an amenable number.
141670157 is a deficient number, since it is larger than the sum of its proper divisors (1).
141670157 is an equidigital number, since it uses as much as digits as its factorization.
141670157 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 5880, while the sum is 32.
The square root of 141670157 is about 11902.5273366626. The cubic root of 141670157 is about 521.3060819109.
The spelling of 141670157 in words is "one hundred forty-one million, six hundred seventy thousand, one hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •