Base | Representation |
---|---|
bin | 10000100110000101011… |
… | …001001101110000101011 |
3 | 11001000120201220112120122 |
4 | 100212011121031300223 |
5 | 122141022001010011 |
6 | 2231521114113455 |
7 | 145251165502556 |
oct | 20460531156053 |
9 | 4030521815518 |
10 | 1140404313131 |
11 | 3aa708560516 |
12 | 16502711b88b |
13 | 8370284c375 |
14 | 3d2a563d69d |
15 | 1e9e7bee3db |
hex | 1098564dc2b |
1140404313131 has 2 divisors, whose sum is σ = 1140404313132. Its totient is φ = 1140404313130.
The previous prime is 1140404313121. The next prime is 1140404313137. The reversal of 1140404313131 is 1313134040411.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 1140404313131 - 210 = 1140404312107 is a prime.
It is a super-2 number, since 2×11404043131312 (a number of 25 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 1140404313131.
It is not a weakly prime, because it can be changed into another prime (1140404313137) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 570202156565 + 570202156566.
It is an arithmetic number, because the mean of its divisors is an integer number (570202156566).
Almost surely, 21140404313131 is an apocalyptic number.
1140404313131 is a deficient number, since it is larger than the sum of its proper divisors (1).
1140404313131 is an equidigital number, since it uses as much as digits as its factorization.
1140404313131 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 1140404313131 its reverse (1313134040411), we get a palindrome (2453538353542).
The spelling of 1140404313131 in words is "one trillion, one hundred forty billion, four hundred four million, three hundred thirteen thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •