Search a number
-
+
1052153216321 is a prime number
BaseRepresentation
bin11110100111110010011…
…01111111110101000001
310201120210100220022121112
433103321031333311001
5114214302210410241
62123204050533105
7136005223530254
oct17237115776501
93646710808545
101052153216321
11376241074269
1214bab7b97195
13782aa16975c
1438cd2b1709b
151c5801861eb
hexf4f937fd41

1052153216321 has 2 divisors, whose sum is σ = 1052153216322. Its totient is φ = 1052153216320.

The previous prime is 1052153216269. The next prime is 1052153216333. The reversal of 1052153216321 is 1236123512501.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 528476657296 + 523676559025 = 726964^2 + 723655^2 .

It is an emirp because it is prime and its reverse (1236123512501) is a distict prime.

It is a cyclic number.

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

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

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

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

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

Almost surely, 21052153216321 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 10800, while the sum is 32.

Adding to 1052153216321 its reverse (1236123512501), we get a palindrome (2288276728822).

The spelling of 1052153216321 in words is "one trillion, fifty-two billion, one hundred fifty-three million, two hundred sixteen thousand, three hundred twenty-one".