Base | Representation |
---|---|
bin | 10000110111000… |
… | …01100100110101 |
3 | 100212010112210111 |
4 | 20123201210311 |
5 | 242201330031 |
6 | 22011223021 |
7 | 3335106343 |
oct | 1033414465 |
9 | 325115714 |
10 | 141433141 |
11 | 729208a3 |
12 | 3b447a71 |
13 | 233bc765 |
14 | 14ad8993 |
15 | c63b1b1 |
hex | 86e1935 |
141433141 has 4 divisors (see below), whose sum is σ = 147582432. Its totient is φ = 135283852.
The previous prime is 141433139. The next prime is 141433157. The reversal of 141433141 is 141334141.
It is a happy number.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 141433141 - 21 = 141433139 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 (141433121) 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, 3074611 + ... + 3074656.
It is an arithmetic number, because the mean of its divisors is an integer number (36895608).
Almost surely, 2141433141 is an apocalyptic number.
It is an amenable number.
141433141 is a deficient number, since it is larger than the sum of its proper divisors (6149291).
141433141 is an equidigital number, since it uses as much as digits as its factorization.
141433141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6149290.
The product of its digits is 576, while the sum is 22.
The square root of 141433141 is about 11892.5666279403. The cubic root of 141433141 is about 521.0152023690.
Adding to 141433141 its reverse (141334141), we get a palindrome (282767282).
The spelling of 141433141 in words is "one hundred forty-one million, four hundred thirty-three thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •