Search a number
-
+
1102113131081 is a prime number
BaseRepresentation
bin10000000010011011000…
…011111100101001001001
310220100202011021221121212
4100002123003330221021
5121024111430143311
62202145341142505
7142424251021364
oct20023303745111
93810664257555
101102113131081
11395449148716
1215971b55aa35
137cc0c812bb1
143b4b1db10db
151da0625dc8b
hex1009b0fca49

1102113131081 has 2 divisors, whose sum is σ = 1102113131082. Its totient is φ = 1102113131080.

The previous prime is 1102113131017. The next prime is 1102113131113. The reversal of 1102113131081 is 1801313112011.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 884662519225 + 217450611856 = 940565^2 + 466316^2 .

It is a cyclic number.

It is not a de Polignac number, because 1102113131081 - 26 = 1102113131017 is a prime.

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

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

It is a pernicious number, because its binary representation contains a prime number (17) of ones.

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

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

Almost surely, 21102113131081 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 144, while the sum is 23.

Adding to 1102113131081 its reverse (1801313112011), we get a palindrome (2903426243092).

The spelling of 1102113131081 in words is "one trillion, one hundred two billion, one hundred thirteen million, one hundred thirty-one thousand, eighty-one".