Base | Representation |
---|---|
bin | 10000100101111011010… |
… | …000110100011111011001 |
3 | 11001000010220002000201002 |
4 | 100211323100310133121 |
5 | 122140144442342223 |
6 | 2231452203034345 |
7 | 145244032656155 |
oct | 20457320643731 |
9 | 4030126060632 |
10 | 1140234340313 |
11 | 3aa630617412 |
12 | 164b9a20b9b5 |
13 | 836a6579533 |
14 | 3d28ac36065 |
15 | 1e9d7d26e28 |
hex | 1097b4347d9 |
1140234340313 has 2 divisors, whose sum is σ = 1140234340314. Its totient is φ = 1140234340312.
The previous prime is 1140234340187. The next prime is 1140234340327. The reversal of 1140234340313 is 3130434320411.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1031833387264 + 108400953049 = 1015792^2 + 329243^2 .
It is a cyclic number.
It is not a de Polignac number, because 1140234340313 - 212 = 1140234336217 is a prime.
It is not a weakly prime, because it can be changed into another prime (1140234340373) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 570117170156 + 570117170157.
It is an arithmetic number, because the mean of its divisors is an integer number (570117170157).
Almost surely, 21140234340313 is an apocalyptic number.
It is an amenable number.
1140234340313 is a deficient number, since it is larger than the sum of its proper divisors (1).
1140234340313 is an equidigital number, since it uses as much as digits as its factorization.
1140234340313 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 10368, while the sum is 29.
Adding to 1140234340313 its reverse (3130434320411), we get a palindrome (4270668660724).
The spelling of 1140234340313 in words is "one trillion, one hundred forty billion, two hundred thirty-four million, three hundred forty thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •