Base | Representation |
---|---|
bin | 11101110101100011001111… |
… | …011001001011001000011101 |
3 | 122012121211022210222220110121 |
4 | 131311203033121023020131 |
5 | 114144430324444412201 |
6 | 1143031054445434541 |
7 | 36432400130604412 |
oct | 3565431731131035 |
9 | 565554283886417 |
10 | 131223320310301 |
11 | 388a255236a63a |
12 | 12873b6056ba51 |
13 | 582b3c93bb56b |
14 | 2459357954109 |
15 | 10286467659a1 |
hex | 7758cf64b21d |
131223320310301 has 2 divisors, whose sum is σ = 131223320310302. Its totient is φ = 131223320310300.
The previous prime is 131223320310289. The next prime is 131223320310307. The reversal of 131223320310301 is 103013023322131.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 114765905023225 + 16457415287076 = 10712885^2 + 4056774^2 .
It is a cyclic number.
It is not a de Polignac number, because 131223320310301 - 229 = 131222783439389 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (131223320310307) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 65611660155150 + 65611660155151.
It is an arithmetic number, because the mean of its divisors is an integer number (65611660155151).
Almost surely, 2131223320310301 is an apocalyptic number.
It is an amenable number.
131223320310301 is a deficient number, since it is larger than the sum of its proper divisors (1).
131223320310301 is an equidigital number, since it uses as much as digits as its factorization.
131223320310301 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1944, while the sum is 25.
Adding to 131223320310301 its reverse (103013023322131), we get a palindrome (234236343632432).
The spelling of 131223320310301 in words is "one hundred thirty-one trillion, two hundred twenty-three billion, three hundred twenty million, three hundred ten thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •