Base | Representation |
---|---|
bin | 11101110011110011010111… |
… | …101110110011000000111011 |
3 | 122012012100021111112101210211 |
4 | 131303303113232303000323 |
5 | 114140443323441041443 |
6 | 1142455551254251551 |
7 | 36420615353350432 |
oct | 3563632756630073 |
9 | 565170244471724 |
10 | 131103201112123 |
11 | 388566121a1129 |
12 | 12854818956bb7 |
13 | 581cc955cb236 |
14 | 2453600860119 |
15 | 10254660b719d |
hex | 773cd7bb303b |
131103201112123 has 2 divisors, whose sum is σ = 131103201112124. Its totient is φ = 131103201112122.
The previous prime is 131103201112099. The next prime is 131103201112129. The reversal of 131103201112123 is 321211102301131.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 131103201112123 - 245 = 95918829023291 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 131103201112094 and 131103201112103.
It is not a weakly prime, because it can be changed into another prime (131103201112129) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 65551600556061 + 65551600556062.
It is an arithmetic number, because the mean of its divisors is an integer number (65551600556062).
Almost surely, 2131103201112123 is an apocalyptic number.
131103201112123 is a deficient number, since it is larger than the sum of its proper divisors (1).
131103201112123 is an equidigital number, since it uses as much as digits as its factorization.
131103201112123 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 216, while the sum is 22.
Adding to 131103201112123 its reverse (321211102301131), we get a palindrome (452314303413254).
The spelling of 131103201112123 in words is "one hundred thirty-one trillion, one hundred three billion, two hundred one million, one hundred twelve thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •