Base | Representation |
---|---|
bin | 11101111000001001111011… |
… | …100011101010101101110101 |
3 | 122020020221022101101012012111 |
4 | 131320021323203222231311 |
5 | 114210343403403321042 |
6 | 1143245215005051021 |
7 | 36451334356354156 |
oct | 3570117343525565 |
9 | 566227271335174 |
10 | 131402302401397 |
11 | 38961449066795 |
12 | 128a2791256a71 |
13 | 5842251195241 |
14 | 2463c9649d92d |
15 | 102d11e901517 |
hex | 77827b8eab75 |
131402302401397 has 2 divisors, whose sum is σ = 131402302401398. Its totient is φ = 131402302401396.
The previous prime is 131402302401379. The next prime is 131402302401407. The reversal of 131402302401397 is 793104203204131.
Together with previous prime (131402302401379) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 77648682798801 + 53753619602596 = 8811849^2 + 7331686^2 .
It is a cyclic number.
It is not a de Polignac number, because 131402302401397 - 211 = 131402302399349 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (131402302401367) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 65701151200698 + 65701151200699.
It is an arithmetic number, because the mean of its divisors is an integer number (65701151200699).
Almost surely, 2131402302401397 is an apocalyptic number.
It is an amenable number.
131402302401397 is a deficient number, since it is larger than the sum of its proper divisors (1).
131402302401397 is an equidigital number, since it uses as much as digits as its factorization.
131402302401397 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 108864, while the sum is 40.
The spelling of 131402302401397 in words is "one hundred thirty-one trillion, four hundred two billion, three hundred two million, four hundred one thousand, three hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •