Search a number
-
+
115364792657 is a prime number
BaseRepresentation
bin110101101110001000…
…1110000100101010001
3102000202222012200101102
41223130101300211101
53342231341331112
6124555311514145
711222563362242
oct1533421604521
9360688180342
10115364792657
1144a20466254
121a437528955
13ab56ac0b2a
1458258c2cc9
1530030aabc2
hex1adc470951

115364792657 has 2 divisors, whose sum is σ = 115364792658. Its totient is φ = 115364792656.

The previous prime is 115364792639. The next prime is 115364792677. The reversal of 115364792657 is 756297463511.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 83030998801 + 32333793856 = 288151^2 + 179816^2 .

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-115364792657 is a prime.

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

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

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

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

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

Almost surely, 2115364792657 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its digits is 9525600, while the sum is 56.

The spelling of 115364792657 in words is "one hundred fifteen billion, three hundred sixty-four million, seven hundred ninety-two thousand, six hundred fifty-seven".