Base | Representation |
---|---|
bin | 11101110011110001011011… |
… | …101101010010110101111111 |
3 | 122012012010220111012101202102 |
4 | 131303301123231102311333 |
5 | 114140430043301442143 |
6 | 1142455005004215315 |
7 | 36420512656201406 |
oct | 3563613355226577 |
9 | 565163814171672 |
10 | 131101120343423 |
11 | 388557446a887a |
12 | 12854337b3a53b |
13 | 581ca234b4959 |
14 | 245348437c63d |
15 | 102539359d0b8 |
hex | 773c5bb52d7f |
131101120343423 has 2 divisors, whose sum is σ = 131101120343424. Its totient is φ = 131101120343422.
The previous prime is 131101120343411. The next prime is 131101120343477. The reversal of 131101120343423 is 324343021101131.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 131101120343423 - 24 = 131101120343407 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (131101120343623) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 65550560171711 + 65550560171712.
It is an arithmetic number, because the mean of its divisors is an integer number (65550560171712).
Almost surely, 2131101120343423 is an apocalyptic number.
131101120343423 is a deficient number, since it is larger than the sum of its proper divisors (1).
131101120343423 is an equidigital number, since it uses as much as digits as its factorization.
131101120343423 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5184, while the sum is 29.
Adding to 131101120343423 its reverse (324343021101131), we get a palindrome (455444141444554).
The spelling of 131101120343423 in words is "one hundred thirty-one trillion, one hundred one billion, one hundred twenty million, three hundred forty-three thousand, four hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •