Base | Representation |
---|---|
bin | 10000100110111101001… |
… | …100001010000010110011 |
3 | 11001002222222100101202001 |
4 | 100212331030022002303 |
5 | 122144431121223011 |
6 | 2232154034034431 |
7 | 145313323310161 |
oct | 20467514120263 |
9 | 4032888311661 |
10 | 1141340414131 |
11 | 400048a00005 |
12 | 165248718a17 |
13 | 83821775998 |
14 | 3d353ab6231 |
15 | 1ea4eeac7c1 |
hex | 109bd30a0b3 |
1141340414131 has 2 divisors, whose sum is σ = 1141340414132. Its totient is φ = 1141340414130.
The previous prime is 1141340414119. The next prime is 1141340414143. The reversal of 1141340414131 is 1314140431411.
It is a balanced prime because it is at equal distance from previous prime (1141340414119) and next prime (1141340414143).
It is a cyclic number.
It is not a de Polignac number, because 1141340414131 - 223 = 1141332025523 is a prime.
It is a super-2 number, since 2×11413404141312 (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 1141340414131.
It is not a weakly prime, because it can be changed into another prime (1141340424131) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 570670207065 + 570670207066.
It is an arithmetic number, because the mean of its divisors is an integer number (570670207066).
Almost surely, 21141340414131 is an apocalyptic number.
1141340414131 is a deficient number, since it is larger than the sum of its proper divisors (1).
1141340414131 is an equidigital number, since it uses as much as digits as its factorization.
1141340414131 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 2304, while the sum is 28.
Adding to 1141340414131 its reverse (1314140431411), we get a palindrome (2455480845542).
The spelling of 1141340414131 in words is "one trillion, one hundred forty-one billion, three hundred forty million, four hundred fourteen thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •