Search a number
-
+
135531351210433 is a prime number
BaseRepresentation
bin11110110100001111011010…
…000010110111100111000001
3122202212200002220011122001111
4132310033122002313213001
5120231021201402213213
61200130124311003321
740355550141221203
oct3664173202674701
9582780086148044
10135531351210433
113a203583510652
121324aa73369541
135a81722a875b9
142567a76824773
1510a0734e80a3d
hex7b43da0b79c1

135531351210433 has 2 divisors, whose sum is σ = 135531351210434. Its totient is φ = 135531351210432.

The previous prime is 135531351210191. The next prime is 135531351210439. The reversal of 135531351210433 is 334012153135531.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 109858655897104 + 25672695313329 = 10481348^2 + 5066823^2 .

It is a cyclic number.

It is not a de Polignac number, because 135531351210433 - 229 = 135530814339521 is a prime.

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

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

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

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

Almost surely, 2135531351210433 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 243000, while the sum is 40.

The spelling of 135531351210433 in words is "one hundred thirty-five trillion, five hundred thirty-one billion, three hundred fifty-one million, two hundred ten thousand, four hundred thirty-three".