Search a number
-
+
10502210025641 is a prime number
BaseRepresentation
bin1001100011010011110001…
…1111110111100010101001
31101012000001001222220022102
42120310330133313202221
52334032011231310031
634200352040503145
72132521361210255
oct230647437674251
941160031886272
1010502210025641
113389a64849494
121217494a7aab5
135b247b108079
14284449a7d265
151332beac37cb
hex98d3c7f78a9

10502210025641 has 2 divisors, whose sum is σ = 10502210025642. Its totient is φ = 10502210025640.

The previous prime is 10502210025607. The next prime is 10502210025673. The reversal of 10502210025641 is 14652001220501.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 9602586230416 + 899623795225 = 3098804^2 + 948485^2 .

It is a cyclic number.

It is not a de Polignac number, because 10502210025641 - 218 = 10502209763497 is a prime.

It is a super-2 number, since 2×105022100256412 (a number of 27 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 (10502210027641) by changing a digit.

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

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

Almost surely, 210502210025641 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 4800, while the sum is 29.

The spelling of 10502210025641 in words is "ten trillion, five hundred two billion, two hundred ten million, twenty-five thousand, six hundred forty-one".