Search a number
-
+
152229581107301 is a prime number
BaseRepresentation
bin100010100111001110110110…
…000110110011000001100101
3201222000000011020200021111202
4202213032312012303001211
5124423112140230413201
61255433145405012245
744031136634364665
oct4247166606630145
9658000136607452
10152229581107301
1144561225a10a65
12150a7142854085
1366c3259a89829
142983d459141a5
15128ec92813c6b
hex8a73b61b3065

152229581107301 has 2 divisors, whose sum is σ = 152229581107302. Its totient is φ = 152229581107300.

The previous prime is 152229581107193. The next prime is 152229581107309. The reversal of 152229581107301 is 103701185922251.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 130033563207076 + 22196017900225 = 11403226^2 + 4711265^2 .

It is a cyclic number.

It is not a de Polignac number, because 152229581107301 - 230 = 152228507365477 is a prime.

It is a congruent number.

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

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

Almost surely, 2152229581107301 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 302400, while the sum is 47.

The spelling of 152229581107301 in words is "one hundred fifty-two trillion, two hundred twenty-nine billion, five hundred eighty-one million, one hundred seven thousand, three hundred one".