Base | Representation |
---|---|
bin | 10000110011110… |
… | …01000101010101 |
3 | 100211022210200122 |
4 | 20121321011111 |
5 | 242044131031 |
6 | 21554121325 |
7 | 3331344464 |
oct | 1031710525 |
9 | 324283618 |
10 | 141005141 |
11 | 72659282 |
12 | 3b280245 |
13 | 2329c9c4 |
14 | 14a269db |
15 | c5a447b |
hex | 8679155 |
141005141 has 4 divisors (see below), whose sum is σ = 141058284. Its totient is φ = 140952000.
The previous prime is 141005119. The next prime is 141005149. The reversal of 141005141 is 141500141.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 75864100 + 65141041 = 8710^2 + 8071^2 .
It is a cyclic number.
It is not a de Polignac number, because 141005141 - 210 = 141004117 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (141005149) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 22370 + ... + 27971.
It is an arithmetic number, because the mean of its divisors is an integer number (35264571).
Almost surely, 2141005141 is an apocalyptic number.
It is an amenable number.
141005141 is a deficient number, since it is larger than the sum of its proper divisors (53143).
141005141 is an equidigital number, since it uses as much as digits as its factorization.
141005141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 53142.
The product of its (nonzero) digits is 80, while the sum is 17.
The square root of 141005141 is about 11874.5585602160. The cubic root of 141005141 is about 520.4891120356.
Adding to 141005141 its reverse (141500141), we get a palindrome (282505282).
The spelling of 141005141 in words is "one hundred forty-one million, five thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.973 sec. • engine limits •