Search a number
-
+
1099168068653 is a prime number
BaseRepresentation
bin11111111111010111000…
…01011011010000101101
310220002010220122021110122
433333223201123100231
5121002044011144103
62200541214214325
7142261260266504
oct17775341332055
93802126567418
101099168068653
113941777a0726
121590391b43a5
137c8606252c5
143b2b2bc983b
151d8d291cb38
hexffeb85b42d

1099168068653 has 2 divisors, whose sum is σ = 1099168068654. Its totient is φ = 1099168068652.

The previous prime is 1099168068619. The next prime is 1099168068671. The reversal of 1099168068653 is 3568608619901.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 1053000240964 + 46167827689 = 1026158^2 + 214867^2 .

It is a cyclic number.

It is not a de Polignac number, because 1099168068653 - 210 = 1099168067629 is a prime.

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

It is a Sophie Germain prime.

It is a Curzon number.

It is a congruent number.

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

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

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

Almost surely, 21099168068653 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 16796160, while the sum is 62.

The spelling of 1099168068653 in words is "one trillion, ninety-nine billion, one hundred sixty-eight million, sixty-eight thousand, six hundred fifty-three".