Search a number
-
+
1099485261101 is a prime number
BaseRepresentation
bin11111111111111100110…
…11011010110100101101
310220002222000111022201002
433333332123122310231
5121003221211323401
62201032504530045
7142302161343023
oct17777633326455
93802860438632
101099485261101
1139431a848047
12159107480925
137c8b1262646
143b302d96713
151d9006c5a6b
hexfffe6dad2d

1099485261101 has 2 divisors, whose sum is σ = 1099485261102. Its totient is φ = 1099485261100.

The previous prime is 1099485261071. The next prime is 1099485261151. The reversal of 1099485261101 is 1011625849901.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 745580440900 + 353904820201 = 863470^2 + 594899^2 .

It is a cyclic number.

It is not a de Polignac number, because 1099485261101 - 226 = 1099418152237 is a prime.

It is a congruent number.

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

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

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

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

Almost surely, 21099485261101 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 155520, while the sum is 47.

The spelling of 1099485261101 in words is "one trillion, ninety-nine billion, four hundred eighty-five million, two hundred sixty-one thousand, one hundred one".