Search a number
BaseRepresentation
bin10100011111010011…
…01011001000101111
31001101121102221201002
422033221223020233
5140012000013241
65015304110515
7536406315653
oct121751531057
931347387632
1011000001071
114735239684
12216ba6543b
131063c27c97
14764cb0a63
15445a8e89b
hex28fa6b22f

11000001071 has 2 divisors, whose sum is σ = 11000001072. Its totient is φ = 11000001070.

The previous prime is 11000001059. The next prime is 11000001109. The reversal of 11000001071 is 17010000011.

Adding to 11000001071 its reverse (17010000011), we get a palindrome (28010001082).

It is a weak prime.

It is an emirp because it is prime and its reverse (17010000011) is a distict prime.

It is a cyclic number.

It is not a de Polignac number, because 11000001071 - 26 = 11000001007 is a prime.

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

It is a congruent number.

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

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

Almost surely, 211000001071 is an apocalyptic number.

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

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

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

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

The spelling of 11000001071 in words is "eleven billion, one thousand, seventy-one".