Base | Representation |
---|---|
bin | 10000110110001… |
… | …10000010010101 |
3 | 100211220211001201 |
4 | 20123012002111 |
5 | 242134222331 |
6 | 22004552501 |
7 | 3334126441 |
oct | 1033060225 |
9 | 324824051 |
10 | 141320341 |
11 | 72854078 |
12 | 3b3b2731 |
13 | 23380306 |
14 | 14aa9821 |
15 | c617a61 |
hex | 86c6095 |
141320341 has 4 divisors (see below), whose sum is σ = 142908300. Its totient is φ = 139732384.
The previous prime is 141320339. The next prime is 141320363. The reversal of 141320341 is 143023141.
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 76195441 + 65124900 = 8729^2 + 8070^2 .
It is a cyclic number.
It is not a de Polignac number, because 141320341 - 21 = 141320339 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (141320141) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 793846 + ... + 794023.
It is an arithmetic number, because the mean of its divisors is an integer number (35727075).
Almost surely, 2141320341 is an apocalyptic number.
It is an amenable number.
141320341 is a deficient number, since it is larger than the sum of its proper divisors (1587959).
141320341 is an equidigital number, since it uses as much as digits as its factorization.
141320341 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1587958.
The product of its (nonzero) digits is 288, while the sum is 19.
The square root of 141320341 is about 11887.8232237866. The cubic root of 141320341 is about 520.8766536398.
Adding to 141320341 its reverse (143023141), we get a palindrome (284343482).
The spelling of 141320341 in words is "one hundred forty-one million, three hundred twenty thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •