Base | Representation |
---|---|
bin | 10000011110011110010… |
… | …000000100000111011111 |
3 | 11000020111011011001100222 |
4 | 100132132100010013133 |
5 | 122022302220111033 |
6 | 2224050120311555 |
7 | 144541515123221 |
oct | 20363620040737 |
9 | 4006434131328 |
10 | 1132231410143 |
11 | 3a71a4128539 |
12 | 1635260125bb |
13 | 829cc54b7b2 |
14 | 3cb2c008411 |
15 | 1e6ba44d598 |
hex | 1079e4041df |
1132231410143 has 2 divisors, whose sum is σ = 1132231410144. Its totient is φ = 1132231410142.
The previous prime is 1132231410133. The next prime is 1132231410179. The reversal of 1132231410143 is 3410141322311.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 1132231410143 - 28 = 1132231409887 is a prime.
It is a super-2 number, since 2×11322314101432 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1132231410113) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 566115705071 + 566115705072.
It is an arithmetic number, because the mean of its divisors is an integer number (566115705072).
Almost surely, 21132231410143 is an apocalyptic number.
1132231410143 is a deficient number, since it is larger than the sum of its proper divisors (1).
1132231410143 is an equidigital number, since it uses as much as digits as its factorization.
1132231410143 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1728, while the sum is 26.
Adding to 1132231410143 its reverse (3410141322311), we get a palindrome (4542372732454).
The spelling of 1132231410143 in words is "one trillion, one hundred thirty-two billion, two hundred thirty-one million, four hundred ten thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •