Search a number
-
+
1091177948153 is a prime number
BaseRepresentation
bin11111110000011110100…
…01100010001111111001
310212022112001211002200202
433320033101202033321
5120334213023320103
62153140310211545
7141556256344526
oct17701721421771
93768461732622
101091177948153
11390847560957
12157589353bb5
137bb89160c57
143ab5597414d
151d5b6224988
hexfe0f4623f9

1091177948153 has 2 divisors, whose sum is σ = 1091177948154. Its totient is φ = 1091177948152.

The previous prime is 1091177948149. The next prime is 1091177948207. The reversal of 1091177948153 is 3518497711901.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 1059197063929 + 31980884224 = 1029173^2 + 178832^2 .

It is a cyclic number.

It is not a de Polignac number, because 1091177948153 - 22 = 1091177948149 is a prime.

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

It is a Sophie Germain prime.

It is a Curzon number.

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

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

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

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

Almost surely, 21091177948153 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 1905120, while the sum is 56.

The spelling of 1091177948153 in words is "one trillion, ninety-one billion, one hundred seventy-seven million, nine hundred forty-eight thousand, one hundred fifty-three".