Search a number
-
+
105352531132369 is a prime number
BaseRepresentation
bin10111111101000101001100…
…001100011011111111010001
3111211000121022000221200221011
4113331011030030123333101
5102302043440432213434
61012022141252530521
731122316635114343
oct2775051414337721
9454017260850834
10105352531132369
1130628837320214
12b996039620a41
1346a29162b8491
141c03138263293
15c2a6db36ee64
hex5fd14c31bfd1

105352531132369 has 2 divisors, whose sum is σ = 105352531132370. Its totient is φ = 105352531132368.

The previous prime is 105352531132367. The next prime is 105352531132379. The reversal of 105352531132369 is 963231135253501.

It is a happy number.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 100526952373969 + 4825578758400 = 10026313^2 + 2196720^2 .

It is a cyclic number.

It is not a de Polignac number, because 105352531132369 - 21 = 105352531132367 is a prime.

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

Together with 105352531132367, it forms a pair of twin primes.

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

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

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

Almost surely, 2105352531132369 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The spelling of 105352531132369 in words is "one hundred five trillion, three hundred fifty-two billion, five hundred thirty-one million, one hundred thirty-two thousand, three hundred sixty-nine".