Search a number
-
+
132653523600439 is a prime number
BaseRepresentation
bin11110001010010111001110…
…001001110000010000110111
3122101200112221010210210221221
4132022113032021300100313
5114341343404020203224
61150044104253451211
736640620656153062
oct3612271611602067
9571615833723857
10132653523600439
11392a4052890836
1212a651847a0b07
13590323452723a
1424a86715a58d9
1510509512a86e4
hex78a5ce270437

132653523600439 has 2 divisors, whose sum is σ = 132653523600440. Its totient is φ = 132653523600438.

The previous prime is 132653523600329. The next prime is 132653523600463. The reversal of 132653523600439 is 934006325356231.

It is a strong prime.

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

It is a cyclic number.

It is not a de Polignac number, because 132653523600439 - 215 = 132653523567671 is a prime.

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

It is a congruent number.

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

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

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

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

Almost surely, 2132653523600439 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 10497600, while the sum is 52.

The spelling of 132653523600439 in words is "one hundred thirty-two trillion, six hundred fifty-three billion, five hundred twenty-three million, six hundred thousand, four hundred thirty-nine".