Search a number
-
+
2011054555261 is a prime number
BaseRepresentation
bin11101010000111100001…
…100010100000001111101
321010020212211221102221201
4131100330030110001331
5230422114431232021
64135510554255501
7265202543450113
oct35207414240175
97106784842851
102011054555261
11705979960874
1228590a127591
1311784588062b
146d49aac1ab3
15374a3746591
hex1d43c31407d

2011054555261 has 2 divisors, whose sum is σ = 2011054555262. Its totient is φ = 2011054555260.

The previous prime is 2011054555247. The next prime is 2011054555283. The reversal of 2011054555261 is 1625554501102.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 1234029935161 + 777024620100 = 1110869^2 + 881490^2 .

It is a cyclic number.

It is not a de Polignac number, because 2011054555261 - 29 = 2011054554749 is a prime.

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

It is a congruent number.

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

It is a pernicious number, because its binary representation contains a prime number (19) of ones.

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

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

Almost surely, 22011054555261 is an apocalyptic number.

It is an amenable number.

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

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

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

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

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