Base | Representation |
---|---|
bin | 11101111000001011110101… |
… | …110010101000100111100111 |
3 | 122020021010121022012210000002 |
4 | 131320023311302220213213 |
5 | 114210412103401122234 |
6 | 1143250154303411515 |
7 | 36451436240402342 |
oct | 3570136562504747 |
9 | 566233538183002 |
10 | 131404353145319 |
11 | 38962300711a81 |
12 | 128a3063bb3b9b |
13 | 58424b9cc8497 |
14 | 246400c9a7459 |
15 | 102d1de98927e |
hex | 7782f5ca89e7 |
131404353145319 has 2 divisors, whose sum is σ = 131404353145320. Its totient is φ = 131404353145318.
The previous prime is 131404353145193. The next prime is 131404353145367. The reversal of 131404353145319 is 913541353404131.
It is a happy number.
Together with previous prime (131404353145193) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 131404353145319 - 212 = 131404353141223 is a prime.
It is a super-2 number, since 2×1314043531453192 (a number of 29 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (131404356145319) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 65702176572659 + 65702176572660.
It is an arithmetic number, because the mean of its divisors is an integer number (65702176572660).
Almost surely, 2131404353145319 is an apocalyptic number.
131404353145319 is a deficient number, since it is larger than the sum of its proper divisors (1).
131404353145319 is an equidigital number, since it uses as much as digits as its factorization.
131404353145319 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1166400, while the sum is 47.
The spelling of 131404353145319 in words is "one hundred thirty-one trillion, four hundred four billion, three hundred fifty-three million, one hundred forty-five thousand, three hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •