Search a number
-
+
11000000009951 is a prime number
BaseRepresentation
bin1010000000010010001100…
…0101111101011011011111
31102221120220220200011221222
42200010203011331123133
52420211000000304301
635221155155443555
72213503153234331
oct240044305753337
942846826604858
1011000000009951
11356108a266437
121297a598b65bb
1361a3ac428744
142a058d579451
151412066ac31b
hexa012317d6df

11000000009951 has 2 divisors, whose sum is σ = 11000000009952. Its totient is φ = 11000000009950.

The previous prime is 11000000009927. The next prime is 11000000010061. The reversal of 11000000009951 is 15990000000011.

It is a happy number.

11000000009951 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It is a weak prime.

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-11000000009951 is a prime.

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

It is a congruent number.

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

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

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

Almost surely, 211000000009951 is an apocalyptic number.

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

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

11000000009951 is an evil number, because the sum of its binary digits is even.

The product of its (nonzero) digits is 405, while the sum is 26.

Adding to 11000000009951 its reverse (15990000000011), we get a palindrome (26990000009962).

The spelling of 11000000009951 in words is "eleven trillion, nine thousand, nine hundred fifty-one".