Search a number
-
+
1101100000061 is a prime number
BaseRepresentation
bin10000000001011110101…
…011001010001100111101
310220021010112220120010202
4100001132223022030331
5121020023100000221
62201501030213245
7142360166400545
oct20013653121475
93807115816122
101101100000061
11394a79276356
121594981b4225
137caaa958c99
143b417606325
151d997336d0b
hex1005eaca33d

1101100000061 has 2 divisors, whose sum is σ = 1101100000062. Its totient is φ = 1101100000060.

The previous prime is 1101100000037. The next prime is 1101100000139. The reversal of 1101100000061 is 1600000011011.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 1095934703161 + 5165296900 = 1046869^2 + 71870^2 .

It is a cyclic number.

It is not a de Polignac number, because 1101100000061 - 26 = 1101099999997 is a prime.

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

It is a congruent number.

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

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

Almost surely, 21101100000061 is an apocalyptic number.

It is an amenable number.

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

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

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

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

Adding to 1101100000061 its reverse (1600000011011), we get a palindrome (2701100011072).

The spelling of 1101100000061 in words is "one trillion, one hundred one billion, one hundred million, sixty-one", and thus it is an aban number.