Search a number
-
+
105065613469 is a prime number
BaseRepresentation
bin110000111011001100…
…1100000100010011101
3101001012012111011120101
41201312121200202131
53210133244112334
6120133320421101
710406423656615
oct1416631404235
9331165434511
10105065613469
1140615888513
1218442317791
139ba513236b
145129b21a45
152aedd02214
hex187666089d

105065613469 has 2 divisors, whose sum is σ = 105065613470. Its totient is φ = 105065613468.

The previous prime is 105065613461. The next prime is 105065613557. The reversal of 105065613469 is 964316560501.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 90099027225 + 14966586244 = 300165^2 + 122338^2 .

It is a cyclic number.

It is not a de Polignac number, because 105065613469 - 23 = 105065613461 is a prime.

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

It is a congruent number.

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

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

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

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

Almost surely, 2105065613469 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 583200, while the sum is 46.

The spelling of 105065613469 in words is "one hundred five billion, sixty-five million, six hundred thirteen thousand, four hundred sixty-nine".