Search a number
-
+
13233302151029 is a prime number
BaseRepresentation
bin1100000010010001111001…
…0001100001111101110101
31201212002110120122202202222
43000210132101201331311
53213303300322313104
644051143423212125
72534034364225622
oct300443621417565
951762416582688
1013233302151029
114242237088964
121598852147045
1374cb83525aac
1433a6d0d2b349
1517e3665b01be
hexc091e461f75

13233302151029 has 2 divisors, whose sum is σ = 13233302151030. Its totient is φ = 13233302151028.

The previous prime is 13233302150993. The next prime is 13233302151053. The reversal of 13233302151029 is 92015120333231.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 9197281420804 + 4036020730225 = 3032702^2 + 2008985^2 .

It is a cyclic number.

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

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

It is a congruent number.

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

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

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

Almost surely, 213233302151029 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 29160, while the sum is 35.

The spelling of 13233302151029 in words is "thirteen trillion, two hundred thirty-three billion, three hundred two million, one hundred fifty-one thousand, twenty-nine".