Search a number
-
+
105519961 is a prime number
BaseRepresentation
bin1100100101000…
…01101101011001
321100112222011201
412102201231121
5204003114321
614245354201
72420622241
oct622415531
9240488151
10105519961
1154621788
122b408961
1318b27161
141002ab21
1593e5291
hex64a1b59

105519961 has 2 divisors, whose sum is σ = 105519962. Its totient is φ = 105519960.

The previous prime is 105519943. The next prime is 105519971. The reversal of 105519961 is 169915501.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 105452361 + 67600 = 10269^2 + 260^2 .

It is a cyclic number.

It is not a de Polignac number, because 105519961 - 211 = 105517913 is a prime.

It is a super-2 number, since 2×1055199612 = 22268924338883042, which contains 22 as substring.

It is a self number, because there is not a number n which added to its sum of digits gives 105519961.

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

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

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

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

Almost surely, 2105519961 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 12150, while the sum is 37.

The square root of 105519961 is about 10272.2909324065. The cubic root of 105519961 is about 472.5468516385.

The spelling of 105519961 in words is "one hundred five million, five hundred nineteen thousand, nine hundred sixty-one".