Base | Representation |
---|---|
bin | 10000110100011… |
… | …10000101000101 |
3 | 100211111011122211 |
4 | 20122032011011 |
5 | 242104404031 |
6 | 22000023421 |
7 | 3332153302 |
oct | 1032160505 |
9 | 324434584 |
10 | 141091141 |
11 | 72707954 |
12 | 3b301b71 |
13 | 232ccba9 |
14 | 14a4a0a9 |
15 | c5bebb1 |
hex | 868e145 |
141091141 has 4 divisors (see below), whose sum is σ = 143753292. Its totient is φ = 138428992.
The previous prime is 141091123. The next prime is 141091147. The reversal of 141091141 is 141190141.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 141190141 = 227 ⋅621983.
It can be written as a sum of positive squares in 2 ways, for example, as 128346241 + 12744900 = 11329^2 + 3570^2 .
It is a cyclic number.
It is not a de Polignac number, because 141091141 - 29 = 141090629 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 (141091147) 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, 1330996 + ... + 1331101.
It is an arithmetic number, because the mean of its divisors is an integer number (35938323).
Almost surely, 2141091141 is an apocalyptic number.
It is an amenable number.
141091141 is a deficient number, since it is larger than the sum of its proper divisors (2662151).
141091141 is an equidigital number, since it uses as much as digits as its factorization.
141091141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2662150.
The product of its (nonzero) digits is 144, while the sum is 22.
The square root of 141091141 is about 11878.1791954828. The cubic root of 141091141 is about 520.5949071534.
The spelling of 141091141 in words is "one hundred forty-one million, ninety-one thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.209 sec. • engine limits •