Base | Representation |
---|---|
bin | 11101110100010110111001… |
… | …000101010001011111111011 |
3 | 122012022222201120121202100002 |
4 | 131310112321011101133323 |
5 | 114142104431423203443 |
6 | 1142525300045503215 |
7 | 36423435461316206 |
oct | 3564267105213773 |
9 | 565288646552302 |
10 | 131141341616123 |
11 | 38870804549313 |
12 | 128600a1b71b0b |
13 | 582376335bcb7 |
14 | 24553bc0a893d |
15 | 10264496e22b8 |
hex | 7745b91517fb |
131141341616123 has 2 divisors, whose sum is σ = 131141341616124. Its totient is φ = 131141341616122.
The previous prime is 131141341616083. The next prime is 131141341616231. The reversal of 131141341616123 is 321616143141131.
Together with next prime (131141341616231) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 131141341616123 - 212 = 131141341612027 is a prime.
It is a super-2 number, since 2×1311413416161232 (a number of 29 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (131141341616023) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 65570670808061 + 65570670808062.
It is an arithmetic number, because the mean of its divisors is an integer number (65570670808062).
Almost surely, 2131141341616123 is an apocalyptic number.
131141341616123 is a deficient number, since it is larger than the sum of its proper divisors (1).
131141341616123 is an equidigital number, since it uses as much as digits as its factorization.
131141341616123 is an evil number, because the sum of its binary digits is even.
The product of its digits is 31104, while the sum is 38.
Adding to 131141341616123 its reverse (321616143141131), we get a palindrome (452757484757254).
The spelling of 131141341616123 in words is "one hundred thirty-one trillion, one hundred forty-one billion, three hundred forty-one million, six hundred sixteen thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •