Search a number
-
+
1100055100961 is a prime number
BaseRepresentation
bin10000000000100000011…
…001001011111000100001
310220011102201202012001002
4100000200121023320201
5121010403101212321
62201205222321345
7142322251035515
oct20004031137041
93804381665032
101100055100961
11394592476183
12159246289255
137c97232b3ab
143b35892c145
151d93573720b
hex1002064be21

1100055100961 has 2 divisors, whose sum is σ = 1100055100962. Its totient is φ = 1100055100960.

The previous prime is 1100055100957. The next prime is 1100055101023. The reversal of 1100055100961 is 1690015500011.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 836712678400 + 263342422561 = 914720^2 + 513169^2 .

It is a cyclic number.

It is not a de Polignac number, because 1100055100961 - 22 = 1100055100957 is a prime.

It is a super-3 number, since 3×11000551009613 (a number of 37 digits) contains 333 as substring.

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

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

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

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

Almost surely, 21100055100961 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 1350, while the sum is 29.

The spelling of 1100055100961 in words is "one trillion, one hundred billion, fifty-five million, one hundred thousand, nine hundred sixty-one".