Base | Representation |
---|---|
bin | 10000100111101100110… |
… | …111001110101001011011 |
3 | 11001012001201100110210102 |
4 | 100213230313032221123 |
5 | 122203100344444311 |
6 | 2232405245010015 |
7 | 145342204544405 |
oct | 20475467165133 |
9 | 4035051313712 |
10 | 1142140234331 |
11 | 400419428838 |
12 | 16543055390b |
13 | 8391b394a85 |
14 | 3d3cbdd5b75 |
15 | 1ea9a2eb43b |
hex | 109ecdcea5b |
1142140234331 has 2 divisors, whose sum is σ = 1142140234332. Its totient is φ = 1142140234330.
The previous prime is 1142140234243. The next prime is 1142140234343. The reversal of 1142140234331 is 1334320412411.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 1142140234331 - 222 = 1142136040027 is a prime.
It is a super-2 number, since 2×11421402343312 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1142140234294 and 1142140234303.
It is not a weakly prime, because it can be changed into another prime (1142140234381) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 571070117165 + 571070117166.
It is an arithmetic number, because the mean of its divisors is an integer number (571070117166).
Almost surely, 21142140234331 is an apocalyptic number.
1142140234331 is a deficient number, since it is larger than the sum of its proper divisors (1).
1142140234331 is an equidigital number, since it uses as much as digits as its factorization.
1142140234331 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6912, while the sum is 29.
Adding to 1142140234331 its reverse (1334320412411), we get a palindrome (2476460646742).
The spelling of 1142140234331 in words is "one trillion, one hundred forty-two billion, one hundred forty million, two hundred thirty-four thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •