Search a number
-
+
105215554103321 is a prime number
BaseRepresentation
bin10111111011000101100111…
…101110100010100000011001
3111210112111201212111122202002
4113323011213232202200121
5102242322423322301241
61011435205215450345
731106400341432414
oct2773054756424031
9453474655448662
10105215554103321
1130585736366982
12b9735902269b5
134692a26ac14bc
141bda6622dab7b
15c26d70c2d89b
hex5fb167ba2819

105215554103321 has 2 divisors, whose sum is σ = 105215554103322. Its totient is φ = 105215554103320.

The previous prime is 105215554103311. The next prime is 105215554103347. The reversal of 105215554103321 is 123301455512501.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 91698607731721 + 13516946371600 = 9575939^2 + 3676540^2 .

It is a cyclic number.

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

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

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

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

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

Almost surely, 2105215554103321 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 90000, while the sum is 38.

The spelling of 105215554103321 in words is "one hundred five trillion, two hundred fifteen billion, five hundred fifty-four million, one hundred three thousand, three hundred twenty-one".