Search a number
-
+
10625238676763 is a prime number
BaseRepresentation
bin1001101010011110000110…
…0100111011010100011011
31101121202121011002221002122
42122213201210323110123
52343040442100124023
634333100043451455
72144435214405314
oct232474144732433
941552534087078
1010625238676763
113427158262a67
1212372aab26b8b
135c0c568c8999
1428a39b32960b
151365c08cc2c8
hex9a9e193b51b

10625238676763 has 2 divisors, whose sum is σ = 10625238676764. Its totient is φ = 10625238676762.

The previous prime is 10625238676757. The next prime is 10625238676781. The reversal of 10625238676763 is 36767683252601.

It is a weak prime.

It is a cyclic number.

It is not a de Polignac number, because 10625238676763 - 26 = 10625238676699 is a prime.

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

It is a junction number, because it is equal to n+sod(n) for n = 10625238676696 and 10625238676705.

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

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

Almost surely, 210625238676763 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 91445760, while the sum is 62.

The spelling of 10625238676763 in words is "ten trillion, six hundred twenty-five billion, two hundred thirty-eight million, six hundred seventy-six thousand, seven hundred sixty-three".