Search a number
-
+
10624630554281 is a prime number
BaseRepresentation
bin1001101010011011110101…
…0101000111111010101001
31101121201000202211002212202
42122212331111013322221
52343033220410214111
634332515441345545
72144414151426422
oct232467525077251
941551022732782
1010624630554281
113426975a675a7
12123715b3382b5
135c0b8a917cb3
1428a34066a649
15136587307b3b
hex9a9bd547ea9

10624630554281 has 2 divisors, whose sum is σ = 10624630554282. Its totient is φ = 10624630554280.

The previous prime is 10624630554271. The next prime is 10624630554341. The reversal of 10624630554281 is 18245503642601.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 10624503225625 + 127328656 = 3259525^2 + 11284^2 .

It is a cyclic number.

It is not a de Polignac number, because 10624630554281 - 214 = 10624630537897 is a prime.

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

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

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

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

Almost surely, 210624630554281 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 1382400, while the sum is 47.

The spelling of 10624630554281 in words is "ten trillion, six hundred twenty-four billion, six hundred thirty million, five hundred fifty-four thousand, two hundred eighty-one".