Search a number
-
+
1153554313397 is a prime number
BaseRepresentation
bin10000110010010101001…
…100011111000010110101
311002021112011221202201112
4100302111030133002311
5122344434401012042
62241534024204405
7146225102611013
oct20622514370265
94067464852645
101153554313397
11405246378332
12167697009705
1384a1a020105
143db91c938b3
15200173d0982
hex10c9531f0b5

1153554313397 has 2 divisors, whose sum is σ = 1153554313398. Its totient is φ = 1153554313396.

The previous prime is 1153554313277. The next prime is 1153554313447. The reversal of 1153554313397 is 7933134553511.

It is an a-pointer prime, because the next prime (1153554313447) can be obtained adding 1153554313397 to its sum of digits (50).

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 943619902801 + 209934410596 = 971401^2 + 458186^2 .

It is a cyclic number.

It is not a de Polignac number, because 1153554313397 - 28 = 1153554313141 is a prime.

It is a congruent number.

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

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

Almost surely, 21153554313397 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its digits is 2551500, while the sum is 50.

The spelling of 1153554313397 in words is "one trillion, one hundred fifty-three billion, five hundred fifty-four million, three hundred thirteen thousand, three hundred ninety-seven".