Search a number
-
+
105565015453 is a prime number
BaseRepresentation
bin110001001010000101…
…0100100110110011101
3101002111000012102022011
41202110022210312131
53212144120443303
6120255040351221
710424666553232
oct1422412446635
9332430172264
10105565015453
1140851776627
1218561615511
139c547381b1
14517619d789
152b2ca9d16d
hex18942a4d9d

105565015453 has 2 divisors, whose sum is σ = 105565015454. Its totient is φ = 105565015452.

The previous prime is 105565015433. The next prime is 105565015541. The reversal of 105565015453 is 354510565501.

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., 58589654809 + 46975360644 = 242053^2 + 216738^2 .

It is a cyclic number.

It is not a de Polignac number, because 105565015453 - 233 = 96975080861 is a prime.

It is a super-2 number, since 2×1055650154532 (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 (105565015433) 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, 52782507726 + 52782507727.

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

Almost surely, 2105565015453 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 225000, while the sum is 40.

The spelling of 105565015453 in words is "one hundred five billion, five hundred sixty-five million, fifteen thousand, four hundred fifty-three".