Search a number
-
+
11037671101 is a prime number
BaseRepresentation
bin10100100011110010…
…10111111010111101
31001111020022210021101
422101321113322331
5140101120433401
65023131333101
7540344441062
oct122171277275
931436283241
1011037671101
114754528736
1221805b1191
13106b987142
14769cb8c69
15449031101
hex291e57ebd

11037671101 has 2 divisors, whose sum is σ = 11037671102. Its totient is φ = 11037671100.

The previous prime is 11037671081. The next prime is 11037671111. The reversal of 11037671101 is 10117673011.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 10532095876 + 505575225 = 102626^2 + 22485^2 .

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

It is a cyclic number.

It is not a de Polignac number, because 11037671101 - 25 = 11037671069 is a prime.

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

It is a congruent number.

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

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

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

Almost surely, 211037671101 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 882, while the sum is 28.

The spelling of 11037671101 in words is "eleven billion, thirty-seven million, six hundred seventy-one thousand, one hundred one".