Search a number
-
+
1102011031061 is a prime number
BaseRepresentation
bin10000000010010100111…
…110011101111000010101
310220100111001011201201122
4100002110332131320111
5121023404310443221
62202131252533325
7142421601131603
oct20022476357025
93810431151648
101102011031061
113953a6552436
121596b1321245
137cbc4615595
143b4a25d4873
151d9ec2e1eab
hex10094f9de15

1102011031061 has 2 divisors, whose sum is σ = 1102011031062. Its totient is φ = 1102011031060.

The previous prime is 1102011031031. The next prime is 1102011031073. The reversal of 1102011031061 is 1601301102011.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 683879380900 + 418131650161 = 826970^2 + 646631^2 .

It is a cyclic number.

It is not a de Polignac number, because 1102011031061 - 230 = 1100937289237 is a prime.

It is a congruent number.

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

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

Almost surely, 21102011031061 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 36, while the sum is 17.

Adding to 1102011031061 its reverse (1601301102011), we get a palindrome (2703312133072).

The spelling of 1102011031061 in words is "one trillion, one hundred two billion, eleven million, thirty-one thousand, sixty-one".