Search a number
-
+
132653663230609 is a prime number
BaseRepresentation
bin11110001010010111010110…
…011110011001101010010001
3122101200120021212112202112201
4132022113112132121222101
5114341344200241334414
61150044130202323201
736640624303043113
oct3612272636315221
9571616255482481
10132653663230609
11392a411468aa74
1212a652034b9501
135903257435141
1424a8685d513b3
15105095d68a574
hex78a5d6799a91

132653663230609 has 2 divisors, whose sum is σ = 132653663230610. Its totient is φ = 132653663230608.

The previous prime is 132653663230597. The next prime is 132653663230721. The reversal of 132653663230609 is 906032366356231.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 110921022929025 + 21732640301584 = 10531905^2 + 4661828^2 .

It is a cyclic number.

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

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

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

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

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

Almost surely, 2132653663230609 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 18895680, while the sum is 55.

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