Search a number
-
+
135232064663 is a prime number
BaseRepresentation
bin111110111110001110…
…1011000110010010111
3110221001112222200001112
41331330131120302113
54203423402032123
6142042540245235
712525114404123
oct1757435306227
9427045880045
10135232064663
1152395a7a813
1222260b4081b
13c9a1b36397
14678c2d8583
1537b7359d78
hex1f7c758c97

135232064663 has 2 divisors, whose sum is σ = 135232064664. Its totient is φ = 135232064662.

The previous prime is 135232064651. The next prime is 135232064707. The reversal of 135232064663 is 366460232531.

It is a weak prime.

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

It is a cyclic number.

It is not a de Polignac number, because 135232064663 - 212 = 135232060567 is a prime.

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

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

It is a congruent number.

It is not a weakly prime, because it can be changed into another prime (135232064603) 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, 67616032331 + 67616032332.

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

Almost surely, 2135232064663 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 466560, while the sum is 41.

The spelling of 135232064663 in words is "one hundred thirty-five billion, two hundred thirty-two million, sixty-four thousand, six hundred sixty-three".