Base | Representation |
---|---|
bin | 10000110100000… |
… | …00001010011111 |
3 | 100211101021110210 |
4 | 20122000022133 |
5 | 242101043033 |
6 | 21554503503 |
7 | 3331525155 |
oct | 1032001237 |
9 | 324337423 |
10 | 141034143 |
11 | 72679048 |
12 | 3b294b93 |
13 | 232acc73 |
14 | 14a333d5 |
15 | c5acd63 |
hex | 868029f |
141034143 has 8 divisors (see below), whose sum is σ = 188496000. Its totient is φ = 93797528.
The previous prime is 141034141. The next prime is 141034177. The reversal of 141034143 is 341430141.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 141034143 - 21 = 141034141 is a prime.
It is an alternating number because its digits alternate between odd and even.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (141034141) 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 7 ways as a sum of consecutive naturals, for example, 54843 + ... + 57356.
It is an arithmetic number, because the mean of its divisors is an integer number (23562000).
Almost surely, 2141034143 is an apocalyptic number.
141034143 is a deficient number, since it is larger than the sum of its proper divisors (47461857).
141034143 is a wasteful number, since it uses less digits than its factorization.
141034143 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 112621.
The product of its (nonzero) digits is 576, while the sum is 21.
The square root of 141034143 is about 11875.7796796674. The cubic root of 141034143 is about 520.5247943999.
Adding to 141034143 its reverse (341430141), we get a palindrome (482464284).
It can be divided in two parts, 1410 and 34143, that added together give a palindrome (35553).
The spelling of 141034143 in words is "one hundred forty-one million, thirty-four thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •