Base | Representation |
---|---|
bin | 11101110110110100111111… |
… | …011110100100110010001011 |
3 | 122012221012220100012021100001 |
4 | 131312310333132210302023 |
5 | 114202400113112321303 |
6 | 1143135253035423431 |
7 | 36441625320641503 |
oct | 3566647736446213 |
9 | 565835810167301 |
10 | 131311100120203 |
11 | 389267a7820a83 |
12 | 12888b798b4b77 |
13 | 5836778260393 |
14 | 245d6c3a3aa03 |
15 | 102aa82c3831d |
hex | 776d3f7a4c8b |
131311100120203 has 2 divisors, whose sum is σ = 131311100120204. Its totient is φ = 131311100120202.
The previous prime is 131311100120159. The next prime is 131311100120219. The reversal of 131311100120203 is 302021001113131.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 131311100120203 - 229 = 131310563249291 is a prime.
It is a super-2 number, since 2×1313111001202032 (a number of 29 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (131311100120243) 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, 65655550060101 + 65655550060102.
It is an arithmetic number, because the mean of its divisors is an integer number (65655550060102).
Almost surely, 2131311100120203 is an apocalyptic number.
131311100120203 is a deficient number, since it is larger than the sum of its proper divisors (1).
131311100120203 is an equidigital number, since it uses as much as digits as its factorization.
131311100120203 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 108, while the sum is 19.
Adding to 131311100120203 its reverse (302021001113131), we get a palindrome (433332101233334).
The spelling of 131311100120203 in words is "one hundred thirty-one trillion, three hundred eleven billion, one hundred million, one hundred twenty thousand, two hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •