Search a number
-
+
10510051510661 is a prime number
BaseRepresentation
bin1001100011110000111111…
…1000110000100110000101
31101012202021120010121112112
42120330033320300212011
52334144041141320121
634204130115030405
72133216605554523
oct230741770604605
941182246117475
1010510051510661
11339231909921a
121218b02b9b405
135b312a85a631
14284991283313
151335cd20b75b
hex98f0fe30985

10510051510661 has 2 divisors, whose sum is σ = 10510051510662. Its totient is φ = 10510051510660.

The previous prime is 10510051510627. The next prime is 10510051510691. The reversal of 10510051510661 is 16601515001501.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 6914454316225 + 3595597194436 = 2629535^2 + 1896206^2 .

It is a cyclic number.

It is not a de Polignac number, because 10510051510661 - 242 = 6112004999557 is a prime.

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

It is a congruent number.

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

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

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

Almost surely, 210510051510661 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 4500, while the sum is 32.

The spelling of 10510051510661 in words is "ten trillion, five hundred ten billion, fifty-one million, five hundred ten thousand, six hundred sixty-one".