Base | Representation |
---|---|
bin | 10000100111111000001… |
… | …111011001101011010101 |
3 | 11001012120000112111011122 |
4 | 100213320033121223111 |
5 | 122203443231322331 |
6 | 2232440224213325 |
7 | 145350013212365 |
oct | 20477017315325 |
9 | 4035500474148 |
10 | 1142331120341 |
11 | 400507156274 |
12 | 16548446a245 |
13 | 8394baaa888 |
14 | 3d4094c49a5 |
15 | 1eaabe5517b |
hex | 109f83d9ad5 |
1142331120341 has 2 divisors, whose sum is σ = 1142331120342. Its totient is φ = 1142331120340.
The previous prime is 1142331120319. The next prime is 1142331120347. The reversal of 1142331120341 is 1430211332411.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 944064856900 + 198266263441 = 971630^2 + 445271^2 .
It is a cyclic number.
It is not a de Polignac number, because 1142331120341 - 26 = 1142331120277 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1142331120341.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1142331120347) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 571165560170 + 571165560171.
It is an arithmetic number, because the mean of its divisors is an integer number (571165560171).
Almost surely, 21142331120341 is an apocalyptic number.
It is an amenable number.
1142331120341 is a deficient number, since it is larger than the sum of its proper divisors (1).
1142331120341 is an equidigital number, since it uses as much as digits as its factorization.
1142331120341 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1728, while the sum is 26.
Adding to 1142331120341 its reverse (1430211332411), we get a palindrome (2572542452752).
The spelling of 1142331120341 in words is "one trillion, one hundred forty-two billion, three hundred thirty-one million, one hundred twenty thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •