Base | Representation |
---|---|
bin | 100010000100100… |
… | …0101111001010101 |
3 | 2221200012022101221 |
4 | 1010021011321111 |
5 | 4320131443013 |
6 | 305235250341 |
7 | 40221221056 |
oct | 10411057125 |
9 | 2850168357 |
10 | 1143234133 |
11 | 5373647a8 |
12 | 27aa499b1 |
13 | 152b0a602 |
14 | abb9472d |
15 | 6a57608d |
hex | 44245e55 |
1143234133 has 2 divisors, whose sum is σ = 1143234134. Its totient is φ = 1143234132.
The previous prime is 1143234109. The next prime is 1143234179. The reversal of 1143234133 is 3314323411.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 861598609 + 281635524 = 29353^2 + 16782^2 .
It is a cyclic number.
It is not a de Polignac number, because 1143234133 - 25 = 1143234101 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1143234098 and 1143234107.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1143234193) 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 as a sum of consecutive naturals, namely, 571617066 + 571617067.
It is an arithmetic number, because the mean of its divisors is an integer number (571617067).
Almost surely, 21143234133 is an apocalyptic number.
It is an amenable number.
1143234133 is a deficient number, since it is larger than the sum of its proper divisors (1).
1143234133 is an equidigital number, since it uses as much as digits as its factorization.
1143234133 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 2592, while the sum is 25.
The square root of 1143234133 is about 33811.7454888091. The cubic root of 1143234133 is about 1045.6308646931.
Adding to 1143234133 its reverse (3314323411), we get a palindrome (4457557544).
The spelling of 1143234133 in words is "one billion, one hundred forty-three million, two hundred thirty-four thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •