Search a number
-
+
1152254872213 is a prime number
BaseRepresentation
bin10000110001000111101…
…111100000101010010101
311002011011121211022112021
4100301013233200222111
5122334304221402323
62241201044453141
7146150643545524
oct20610757405225
94064147738467
101152254872213
114047399219a5
121673939aa1b1
1384870a4c5c3
143daab47a4bb
151ee8d2a105d
hex10c47be0a95

1152254872213 has 2 divisors, whose sum is σ = 1152254872214. Its totient is φ = 1152254872212.

The previous prime is 1152254872207. The next prime is 1152254872243. The reversal of 1152254872213 is 3122784522511.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 733021931889 + 419232940324 = 856167^2 + 647482^2 .

It is a cyclic number.

It is not a de Polignac number, because 1152254872213 - 213 = 1152254864021 is a prime.

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

It is a congruent number.

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

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

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

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

Almost surely, 21152254872213 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its digits is 268800, while the sum is 43.

The spelling of 1152254872213 in words is "one trillion, one hundred fifty-two billion, two hundred fifty-four million, eight hundred seventy-two thousand, two hundred thirteen".