Search a number
-
+
11000010005953 is a prime number
BaseRepresentation
bin1010000000010010001110…
…1100000101110111000001
31102221120221121111000220021
42200010203230011313001
52420211010030142303
635221200154013441
72213503334216233
oct240044354056701
942846847430807
1011000010005953
1135610949735a1
121297a61117281
1361a3b1518537
142a0590a1c253
151412074d3ebd
hexa0123b05dc1

11000010005953 has 2 divisors, whose sum is σ = 11000010005954. Its totient is φ = 11000010005952.

The previous prime is 11000010005891. The next prime is 11000010006049. The reversal of 11000010005953 is 35950001000011.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 10612948093504 + 387061912449 = 3257752^2 + 622143^2 .

It is a cyclic number.

It is not a de Polignac number, because 11000010005953 - 217 = 11000009874881 is a prime.

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

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

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

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

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

Almost surely, 211000010005953 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 675, while the sum is 25.

Adding to 11000010005953 its reverse (35950001000011), we get a palindrome (46950011005964).

The spelling of 11000010005953 in words is "eleven trillion, ten million, five thousand, nine hundred fifty-three".