Base | Representation |
---|---|
bin | 100010000011000… |
… | …0010000110001111 |
3 | 2221121200120021121 |
4 | 1010012002012033 |
5 | 4314430312033 |
6 | 305210141411 |
7 | 40211340646 |
oct | 10406020617 |
9 | 2847616247 |
10 | 1142432143 |
11 | 5369671a6 |
12 | 27a721867 |
13 | 1528b9568 |
14 | aba2635d |
15 | 6a46862d |
hex | 4418218f |
1142432143 has 4 divisors (see below), whose sum is σ = 1143072520. Its totient is φ = 1141791768.
The previous prime is 1142432141. The next prime is 1142432153. The reversal of 1142432143 is 3412342411.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 3412342411 = 19 ⋅179596969.
It is a cyclic number.
It is not a de Polignac number, because 1142432143 - 21 = 1142432141 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 (1142432141) 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, 317505 + ... + 321082.
It is an arithmetic number, because the mean of its divisors is an integer number (285768130).
Almost surely, 21142432143 is an apocalyptic number.
1142432143 is a deficient number, since it is larger than the sum of its proper divisors (640377).
1142432143 is an equidigital number, since it uses as much as digits as its factorization.
1142432143 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 640376.
The product of its digits is 2304, while the sum is 25.
The square root of 1142432143 is about 33799.8837719895. The cubic root of 1142432143 is about 1045.3863007141.
Adding to 1142432143 its reverse (3412342411), we get a palindrome (4554774554).
The spelling of 1142432143 in words is "one billion, one hundred forty-two million, four hundred thirty-two thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.151 sec. • engine limits •