Search a number
-
+
155013433202497 is a prime number
BaseRepresentation
bin100011001111101111100000…
…100111110001011101000001
3202022212010202200112022102011
4203033233200213301131001
5130304220002344434442
61305404104344452521
744436231244642312
oct4317574047613501
9668763680468364
10155013433202497
114543491193a671
121547678517a141
13686591c999cbc
142a3c993c96609
1512dc3c6124117
hex8cfbe09f1741

155013433202497 has 2 divisors, whose sum is σ = 155013433202498. Its totient is φ = 155013433202496.

The previous prime is 155013433202351. The next prime is 155013433202669. The reversal of 155013433202497 is 794202334310551.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 148685612456241 + 6327820746256 = 12193671^2 + 2515516^2 .

It is a cyclic number.

It is not a de Polignac number, because 155013433202497 - 211 = 155013433200449 is a prime.

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

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

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

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

Almost surely, 2155013433202497 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 2721600, while the sum is 49.

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