Search a number
-
+
1000001115011 is a prime number
BaseRepresentation
bin11101000110101001011…
…01100001001110000011
310112121011210112001222202
432203110231201032003
5112341000241140021
62043221050223415
7132150650141543
oct16432455411603
93477153461882
101000001115011
11356109617698
12141982424b6b
13733b8599202
1436586657323
151b02b8d6a0b
hexe8d4b61383

1000001115011 has 2 divisors, whose sum is σ = 1000001115012. Its totient is φ = 1000001115010.

The previous prime is 1000001114999. The next prime is 1000001115049. The reversal of 1000001115011 is 1105111000001.

It is a happy number.

It is a weak prime.

It is a cyclic number.

It is not a de Polignac number, because 1000001115011 - 214 = 1000001098627 is a prime.

It is a junction number, because it is equal to n+sod(n) for n = 1000001114983 and 1000001115001.

It is not a weakly prime, because it can be changed into another prime (1000001115611) 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, 500000557505 + 500000557506.

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

Almost surely, 21000001115011 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 5, while the sum is 11.

Adding to 1000001115011 its reverse (1105111000001), we get a palindrome (2105112115012).

The spelling of 1000001115011 in words is "one trillion, one million, one hundred fifteen thousand, eleven".