Search a number
-
+
113053366172713 is a prime number
BaseRepresentation
bin11001101101001001001001…
…101110110011110000101001
3112211021210111110200112001111
4121231021021232303300221
5104304231243220011323
61040235555513350321
732545556542665211
oct3155111156636051
9484253443615044
10113053366172713
1133027732a0033a
121081a5bb7083a1
134b10b6b081b45
141dcbb5264b241
15d10b9e0c0c0d
hex66d249bb3c29

113053366172713 has 2 divisors, whose sum is σ = 113053366172714. Its totient is φ = 113053366172712.

The previous prime is 113053366172557. The next prime is 113053366172723. The reversal of 113053366172713 is 317271663350311.

It is a happy number.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 91724043189289 + 21329322983424 = 9577267^2 + 4618368^2 .

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

It is a cyclic number.

It is not a de Polignac number, because 113053366172713 - 213 = 113053366164521 is a prime.

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

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

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

Almost surely, 2113053366172713 is an apocalyptic number.

It is an amenable number.

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

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

113053366172713 is an evil number, because the sum of its binary digits is even.

The product of its (nonzero) digits is 1428840, while the sum is 49.

The spelling of 113053366172713 in words is "one hundred thirteen trillion, fifty-three billion, three hundred sixty-six million, one hundred seventy-two thousand, seven hundred thirteen".