Base | Representation |
---|---|
bin | 10000111000001… |
… | …10010111110101 |
3 | 100212102012112201 |
4 | 20130012113311 |
5 | 242221140421 |
6 | 22014344501 |
7 | 3336304636 |
oct | 1034062765 |
9 | 325365481 |
10 | 141583861 |
11 | 72a14061 |
12 | 3b4bb131 |
13 | 23443243 |
14 | 14b3788d |
15 | c66ab91 |
hex | 87065f5 |
141583861 has 2 divisors, whose sum is σ = 141583862. Its totient is φ = 141583860.
The previous prime is 141583859. The next prime is 141583901. The reversal of 141583861 is 168385141.
141583861 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 86601636 + 54982225 = 9306^2 + 7415^2 .
It is a cyclic number.
It is not a de Polignac number, because 141583861 - 21 = 141583859 is a prime.
Together with 141583859, it forms a pair of twin primes.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 141583861.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (141583831) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 70791930 + 70791931.
It is an arithmetic number, because the mean of its divisors is an integer number (70791931).
Almost surely, 2141583861 is an apocalyptic number.
It is an amenable number.
141583861 is a deficient number, since it is larger than the sum of its proper divisors (1).
141583861 is an equidigital number, since it uses as much as digits as its factorization.
141583861 is an evil number, because the sum of its binary digits is even.
The product of its digits is 23040, while the sum is 37.
The square root of 141583861 is about 11898.9016720032. The cubic root of 141583861 is about 521.2002121262.
The spelling of 141583861 in words is "one hundred forty-one million, five hundred eighty-three thousand, eight hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.112 sec. • engine limits •