Search a number
-
+
68013115537 is a prime number
BaseRepresentation
bin111111010101111001…
…011100100010010001
320111112221200020210011
4333111321130202101
52103242324144122
651124513034521
74625266641403
oct772571344221
9214487606704
1068013115537
11269316a33a4
1211221555a41
13654b912c83
143412bb2b73
151b80e8e377
hexfd5e5c891

68013115537 has 2 divisors, whose sum is σ = 68013115538. Its totient is φ = 68013115536.

The previous prime is 68013115531. The next prime is 68013115553. The reversal of 68013115537 is 73551131086.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 35443333696 + 32569781841 = 188264^2 + 180471^2 .

It is a cyclic number.

It is not a de Polignac number, because 68013115537 - 27 = 68013115409 is a prime.

It is a self number, because there is not a number n which added to its sum of digits gives 68013115537.

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

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

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

Almost surely, 268013115537 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The spelling of 68013115537 in words is "sixty-eight billion, thirteen million, one hundred fifteen thousand, five hundred thirty-seven".