Base | Representation |
---|---|
bin | 111101010101011001… |
… | …1001001111011001001 |
3 | 110120222102011200201211 |
4 | 1322222303021323021 |
5 | 4124222411234333 |
6 | 140301524013121 |
7 | 12342003151465 |
oct | 1725263117311 |
9 | 416872150654 |
10 | 131714555593 |
11 | 50950484125 |
12 | 2163ab311a1 |
13 | c56117937a |
14 | 653709d4a5 |
15 | 365d63eecd |
hex | 1eaacc9ec9 |
131714555593 has 2 divisors, whose sum is σ = 131714555594. Its totient is φ = 131714555592.
The previous prime is 131714555519. The next prime is 131714555659. The reversal of 131714555593 is 395555417131.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 80625898809 + 51088656784 = 283947^2 + 226028^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-131714555593 is a prime.
It is a super-2 number, since 2×1317145555932 (a number of 23 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (131714555993) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 65857277796 + 65857277797.
It is an arithmetic number, because the mean of its divisors is an integer number (65857277797).
Almost surely, 2131714555593 is an apocalyptic number.
It is an amenable number.
131714555593 is a deficient number, since it is larger than the sum of its proper divisors (1).
131714555593 is an equidigital number, since it uses as much as digits as its factorization.
131714555593 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 1417500, while the sum is 49.
The spelling of 131714555593 in words is "one hundred thirty-one billion, seven hundred fourteen million, five hundred fifty-five thousand, five hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.135 sec. • engine limits •