Search a number
-
+
132653963230597 is a prime number
BaseRepresentation
bin11110001010010111101000…
…010110110011110110000101
3122101200121001210001100011101
4132022113220112303312011
5114341400304041334342
61150044220040340101
736640634605022464
oct3612275026636605
9571617053040141
10132653963230597
11392a4258a64446
1212a65287a74631
1359032a4632c23
1424a86b3b249db
151050979b993b7
hex78a5e85b3d85

132653963230597 has 2 divisors, whose sum is σ = 132653963230598. Its totient is φ = 132653963230596.

The previous prime is 132653963230561. The next prime is 132653963230619. The reversal of 132653963230597 is 795032369356231.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 128519089063876 + 4134874166721 = 11336626^2 + 2033439^2 .

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

It is a cyclic number.

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

It is a congruent number.

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

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

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

Almost surely, 2132653963230597 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 165337200, while the sum is 64.

The spelling of 132653963230597 in words is "one hundred thirty-two trillion, six hundred fifty-three billion, nine hundred sixty-three million, two hundred thirty thousand, five hundred ninety-seven".