Base | Representation |
---|---|
bin | 11001011110000010001110… |
… | …110100010111111111110011 |
3 | 112200121112122220221120202022 |
4 | 121132002032310113333303 |
5 | 104140224003123033011 |
6 | 1034123014003342055 |
7 | 32410553446054421 |
oct | 3136021664277763 |
9 | 480545586846668 |
10 | 112015143174131 |
11 | 327673a010291a |
12 | 1069135098192b |
13 | 4a66ca0c308a2 |
14 | 1d937c1a44111 |
15 | ce3b86d868db |
hex | 65e08ed17ff3 |
112015143174131 has 2 divisors, whose sum is σ = 112015143174132. Its totient is φ = 112015143174130.
The previous prime is 112015143174091. The next prime is 112015143174163. The reversal of 112015143174131 is 131471341510211.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 112015143174131 - 210 = 112015143173107 is a prime.
It is a super-2 number, since 2×1120151431741312 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 112015143174091 and 112015143174100.
It is not a weakly prime, because it can be changed into another prime (112015143174191) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 56007571587065 + 56007571587066.
It is an arithmetic number, because the mean of its divisors is an integer number (56007571587066).
Almost surely, 2112015143174131 is an apocalyptic number.
112015143174131 is a deficient number, since it is larger than the sum of its proper divisors (1).
112015143174131 is an equidigital number, since it uses as much as digits as its factorization.
112015143174131 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 10080, while the sum is 35.
Adding to 112015143174131 its reverse (131471341510211), we get a palindrome (243486484684342).
The spelling of 112015143174131 in words is "one hundred twelve trillion, fifteen billion, one hundred forty-three million, one hundred seventy-four thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •