Search a number
-
+
11001650505661 is a prime number
BaseRepresentation
bin1010000000011000010101…
…1110000110011110111101
31102221202011221101001102201
42200012011132012132331
52420222340012140121
635222031035351501
72213562104225224
oct240060536063675
942852157331381
1011001650505661
113561856997282
12129823a5b2591
1361a5b336141a
142a06a8855cbb
151412a1532e91
hexa01857867bd

11001650505661 has 2 divisors, whose sum is σ = 11001650505662. Its totient is φ = 11001650505660.

The previous prime is 11001650505653. The next prime is 11001650505667. The reversal of 11001650505661 is 16650505610011.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 7052662819225 + 3948987686436 = 2655685^2 + 1987206^2 .

It is a cyclic number.

It is not a de Polignac number, because 11001650505661 - 23 = 11001650505653 is a prime.

It is a self number, because there is not a number n which added to its sum of digits gives 11001650505661.

It is a congruent number.

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

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

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

Almost surely, 211001650505661 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 27000, while the sum is 37.

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