Search a number
-
+
138764117055713 is a prime number
BaseRepresentation
bin11111100011010010001001…
…111001111001100011100001
3200012022201102220102222211012
4133203102021321321203201
5121142002402431240323
61211043204430230305
741141243115425102
oct3743221171714341
9605281386388735
10138764117055713
114023a593560aa6
12136914ba055395
135c57527cca8a6
14263a30d2da3a9
15110988e4b2678
hex7e3489e798e1

138764117055713 has 2 divisors, whose sum is σ = 138764117055714. Its totient is φ = 138764117055712.

The previous prime is 138764117055671. The next prime is 138764117055719. The reversal of 138764117055713 is 317550711467831.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 125302680801424 + 13461436254289 = 11193868^2 + 3668983^2 .

It is an emirp because it is prime and its reverse (317550711467831) is a distict prime.

It is a cyclic number.

It is not a de Polignac number, because 138764117055713 - 232 = 138759822088417 is a prime.

It is not a weakly prime, because it can be changed into another prime (138764117055719) by changing a digit.

It is a polite number, since it can be written as a sum of consecutive naturals, namely, 69382058527856 + 69382058527857.

It is an arithmetic number, because the mean of its divisors is an integer number (69382058527857).

Almost surely, 2138764117055713 is an apocalyptic number.

It is an amenable number.

138764117055713 is a deficient number, since it is larger than the sum of its proper divisors (1).

138764117055713 is an equidigital number, since it uses as much as digits as its factorization.

138764117055713 is an odious number, because the sum of its binary digits is odd.

The product of its (nonzero) digits is 14817600, while the sum is 59.

The spelling of 138764117055713 in words is "one hundred thirty-eight trillion, seven hundred sixty-four billion, one hundred seventeen million, fifty-five thousand, seven hundred thirteen".