Search a number
-
+
155014535139469 is a prime number
BaseRepresentation
bin100011001111110000100010…
…010011010101000010001101
3202022212020121111000111202121
4203033300202103111002031
5130304224231443430334
61305404405551052541
744436300455153455
oct4317604223250215
9668766544014677
10155014535139469
1145435327958185
1215476a32211151
136865a67078505
142a3ca5a37ad65
1512dc43cc3ddb4
hex8cfc224d508d

155014535139469 has 2 divisors, whose sum is σ = 155014535139470. Its totient is φ = 155014535139468.

The previous prime is 155014535139461. The next prime is 155014535139517. The reversal of 155014535139469 is 964931535410551.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 95327631106569 + 59686904032900 = 9763587^2 + 7725730^2 .

It is a cyclic number.

It is not a de Polignac number, because 155014535139469 - 23 = 155014535139461 is a prime.

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

It is a congruent number.

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

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

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

Almost surely, 2155014535139469 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 43740000, while the sum is 61.

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