Search a number
-
+
105010415551 is a prime number
BaseRepresentation
bin110000111001100011…
…0111100011110111111
3101001001100121211021001
41201303012330132333
53210030131244201
6120124025351131
710405153543006
oct1416306743677
9331040554231
10105010415551
11405977074a8
12184279384a7
139b96877082
145122673c3d
152ae904c301
hex18731bc7bf

105010415551 has 2 divisors, whose sum is σ = 105010415552. Its totient is φ = 105010415550.

The previous prime is 105010415533. The next prime is 105010415579. The reversal of 105010415551 is 155514010501.

It is an a-pointer prime, because the next prime (105010415579) can be obtained adding 105010415551 to its sum of digits (28).

It is a weak prime.

It is a cyclic number.

It is not a de Polignac number, because 105010415551 - 221 = 105008318399 is a prime.

It is a super-2 number, since 2×1050104155512 (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 (105010410551) by changing a digit.

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

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

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

Almost surely, 2105010415551 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 2500, while the sum is 28.

The spelling of 105010415551 in words is "one hundred five billion, ten million, four hundred fifteen thousand, five hundred fifty-one".