Search a number
-
+
105415139633 is a prime number
BaseRepresentation
bin110001000101100111…
…0110110000100110001
3101002002120011221022212
41202023032312010301
53211342233432013
6120232124141505
710421166621416
oct1421316660461
9332076157285
10105415139633
1140785109711
121851b397895
139c2c68098b
14516030810d
152b1e8456a8
hex188b3b6131

105415139633 has 2 divisors, whose sum is σ = 105415139634. Its totient is φ = 105415139632.

The previous prime is 105415139629. The next prime is 105415139651. The reversal of 105415139633 is 336931514501.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 104621196304 + 793943329 = 323452^2 + 28177^2 .

It is a cyclic number.

It is not a de Polignac number, because 105415139633 - 22 = 105415139629 is a prime.

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

It is a Sophie Germain prime.

It is a Curzon number.

It is not a weakly prime, because it can be changed into another prime (105415139653) 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, 52707569816 + 52707569817.

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

Almost surely, 2105415139633 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 145800, while the sum is 41.

The spelling of 105415139633 in words is "one hundred five billion, four hundred fifteen million, one hundred thirty-nine thousand, six hundred thirty-three".