Search a number
-
+
115551041961529 is a prime number
BaseRepresentation
bin11010010001011111010010…
…110011110011111000111001
3120011010120102210022220220101
4122101133102303303320321
5110121142013220232104
61045431225453555401
733224200352623006
oct3221372263637071
9504116383286811
10115551041961529
11338aaa15861329
1210b626961a5b61
134c62555092995
1420769b378c8ad
15d55b33b2b5a4
hex6917d2cf3e39

115551041961529 has 2 divisors, whose sum is σ = 115551041961530. Its totient is φ = 115551041961528.

The previous prime is 115551041961499. The next prime is 115551041961533. The reversal of 115551041961529 is 925169140155511.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 79545617757225 + 36005424204304 = 8918835^2 + 6000452^2 .

It is a cyclic number.

It is not a de Polignac number, because 115551041961529 - 217 = 115551041830457 is a prime.

It is a self number, because there is not a number n which added to its sum of digits gives 115551041961529.

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

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

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

Almost surely, 2115551041961529 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 2430000, while the sum is 55.

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