Search a number
-
+
101952848390413 is a prime number
BaseRepresentation
bin10111001011100110111111…
…010011111110100100001101
3111100222121010022002102201011
4113023212333103332210031
5101330343413141443123
61000500254133045221
730321564424444636
oct2713467723764415
9440877108072634
10101952848390413
112a537a62013879
12b52718a786811
1344b715caab3c7
141b2678939088d
15bbc062eeee0d
hex5cb9bf4fe90d

101952848390413 has 2 divisors, whose sum is σ = 101952848390414. Its totient is φ = 101952848390412.

The previous prime is 101952848390333. The next prime is 101952848390479. The reversal of 101952848390413 is 314093848259101.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 92240139013929 + 9712709376484 = 9604173^2 + 3116522^2 .

It is a cyclic number.

It is not a de Polignac number, because 101952848390413 - 213 = 101952848382221 is a prime.

It is a congruent number.

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

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

Almost surely, 2101952848390413 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 7464960, while the sum is 58.

The spelling of 101952848390413 in words is "one hundred one trillion, nine hundred fifty-two billion, eight hundred forty-eight million, three hundred ninety thousand, four hundred thirteen".