Base | Representation |
---|---|
bin | 11101110110111000000101… |
… | …010111101011111010000111 |
3 | 122012221112110201111221220212 |
4 | 131312320011113223322013 |
5 | 114202423413033000033 |
6 | 1143141002320350035 |
7 | 36442103514116552 |
oct | 3566700527537207 |
9 | 565845421457825 |
10 | 131314420203143 |
11 | 38928150932481 |
12 | 1288974577531b |
13 | 5836b870547b8 |
14 | 245d91a963699 |
15 | 102abc9456748 |
hex | 776e055ebe87 |
131314420203143 has 2 divisors, whose sum is σ = 131314420203144. Its totient is φ = 131314420203142.
The previous prime is 131314420203137. The next prime is 131314420203181. The reversal of 131314420203143 is 341302024413131.
It is a weak prime.
It is an emirp because it is prime and its reverse (341302024413131) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 131314420203143 - 214 = 131314420186759 is a prime.
It is a super-2 number, since 2×1313144202031432 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (131314420203103) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 65657210101571 + 65657210101572.
It is an arithmetic number, because the mean of its divisors is an integer number (65657210101572).
Almost surely, 2131314420203143 is an apocalyptic number.
131314420203143 is a deficient number, since it is larger than the sum of its proper divisors (1).
131314420203143 is an equidigital number, since it uses as much as digits as its factorization.
131314420203143 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 20736, while the sum is 32.
Adding to 131314420203143 its reverse (341302024413131), we get a palindrome (472616444616274).
The spelling of 131314420203143 in words is "one hundred thirty-one trillion, three hundred fourteen billion, four hundred twenty million, two hundred three thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.142 sec. • engine limits •