Search a number
-
+
201152280525367 is a prime number
BaseRepresentation
bin101101101111001001101010…
…001110011111101000110111
3222101012222012021201200121111
4231233021222032133220313
5202331134332303302432
61551452025412055451
760240526013216023
oct5557115216375067
9871188167650544
10201152280525367
11591032263668a6
121a6887ab904587
13883176a420a62
143795b7265b383
15183c67470b347
hexb6f26a39fa37

201152280525367 has 2 divisors, whose sum is σ = 201152280525368. Its totient is φ = 201152280525366.

The previous prime is 201152280525341. The next prime is 201152280525377. The reversal of 201152280525367 is 763525082251102.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 201152280525367 - 215 = 201152280492599 is a prime.

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

It is a congruent number.

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

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

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

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

Almost surely, 2201152280525367 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 2016000, while the sum is 49.

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