Base | Representation |
---|---|
bin | 11101110101010011001111… |
… | …000101100110101101100011 |
3 | 122012120011222011101111111112 |
4 | 131311103033011212231203 |
5 | 114144140131114424303 |
6 | 1143015133315333535 |
7 | 36431221226534261 |
oct | 3565231705465543 |
9 | 565504864344445 |
10 | 131206135311203 |
11 | 38896233934447 |
12 | 128707652b12ab |
13 | 58298bac93a44 |
14 | 24585a7479431 |
15 | 1027e8cbe90d8 |
hex | 7754cf166b63 |
131206135311203 has 2 divisors, whose sum is σ = 131206135311204. Its totient is φ = 131206135311202.
The previous prime is 131206135311103. The next prime is 131206135311311. The reversal of 131206135311203 is 302113531602131.
It is a weak prime.
It is an emirp because it is prime and its reverse (302113531602131) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 131206135311203 - 220 = 131206134262627 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 131206135311203.
It is not a weakly prime, because it can be changed into another prime (131206135311103) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 65603067655601 + 65603067655602.
It is an arithmetic number, because the mean of its divisors is an integer number (65603067655602).
Almost surely, 2131206135311203 is an apocalyptic number.
131206135311203 is a deficient number, since it is larger than the sum of its proper divisors (1).
131206135311203 is an equidigital number, since it uses as much as digits as its factorization.
131206135311203 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 9720, while the sum is 32.
Adding to 131206135311203 its reverse (302113531602131), we get a palindrome (433319666913334).
The spelling of 131206135311203 in words is "one hundred thirty-one trillion, two hundred six billion, one hundred thirty-five million, three hundred eleven thousand, two hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •