Base | Representation |
---|---|
bin | 100010000010110… |
… | …1000010001100011 |
3 | 2221121111012012010 |
4 | 1010011220101203 |
5 | 4314413420441 |
6 | 305204004003 |
7 | 40210420404 |
oct | 10405502143 |
9 | 2847435163 |
10 | 1142326371 |
11 | 5368a478a |
12 | 27a690603 |
13 | 152880384 |
14 | ab9d99ab |
15 | 6a447116 |
hex | 44168463 |
1142326371 has 4 divisors (see below), whose sum is σ = 1523101832. Its totient is φ = 761550912.
The previous prime is 1142326363. The next prime is 1142326391. The reversal of 1142326371 is 1736232411.
It is a happy number.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 1736232411 = 3 ⋅578744137.
It is not a de Polignac number, because 1142326371 - 23 = 1142326363 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1142326391) 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, 190387726 + ... + 190387731.
It is an arithmetic number, because the mean of its divisors is an integer number (380775458).
Almost surely, 21142326371 is an apocalyptic number.
1142326371 is a deficient number, since it is larger than the sum of its proper divisors (380775461).
1142326371 is an equidigital number, since it uses as much as digits as its factorization.
1142326371 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 380775460.
The product of its digits is 6048, while the sum is 30.
The square root of 1142326371 is about 33798.3190558347. The cubic root of 1142326371 is about 1045.3540373792.
Adding to 1142326371 its reverse (1736232411), we get a palindrome (2878558782).
The spelling of 1142326371 in words is "one billion, one hundred forty-two million, three hundred twenty-six thousand, three hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •