Search a number
-
+
10144757713 is a prime number
BaseRepresentation
bin10010111001010110…
…01011011111010001
3222012000011002101011
421130223023133101
5131234024221323
64354353210521
7506253006046
oct113453133721
928160132334
1010144757713
1143364a6692
121b71560a41
13c589a221c
146c34851cd
153e595420d
hex25cacb7d1

10144757713 has 2 divisors, whose sum is σ = 10144757714. Its totient is φ = 10144757712.

The previous prime is 10144757669. The next prime is 10144757741. The reversal of 10144757713 is 31775744101.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 8243187264 + 1901570449 = 90792^2 + 43607^2 .

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

It is a cyclic number.

It is not a de Polignac number, because 10144757713 - 225 = 10111203281 is a prime.

It is a super-2 number, since 2×101447577132 (a number of 21 digits) contains 22 as substring.

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

It is a pernicious number, because its binary representation contains a prime number (19) of ones.

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

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

Almost surely, 210144757713 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 82320, while the sum is 40.

The spelling of 10144757713 in words is "ten billion, one hundred forty-four million, seven hundred fifty-seven thousand, seven hundred thirteen".