Search a number
-
+
15055523145737 is a prime number
BaseRepresentation
bin1101101100010110001100…
…0110111110100000001001
31222022021221021221102110122
43123011203012332200021
53433132202411130422
652004224543153025
73112503620144054
oct333054306764011
958267837842418
1015055523145737
114885014356788
121831a402a5775
13852964318379
143a0996965a9b
151b1966d4bd42
hexdb1631be809

15055523145737 has 2 divisors, whose sum is σ = 15055523145738. Its totient is φ = 15055523145736.

The previous prime is 15055523145709. The next prime is 15055523145739. The reversal of 15055523145737 is 73754132555051.

It is a happy number.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 10540340134921 + 4515183010816 = 3246589^2 + 2124896^2 .

It is a cyclic number.

It is not a de Polignac number, because 15055523145737 - 216 = 15055523080201 is a prime.

Together with 15055523145739, it forms a pair of twin primes.

It is a Chen prime.

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

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

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

Almost surely, 215055523145737 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 11025000, while the sum is 53.

The spelling of 15055523145737 in words is "fifteen trillion, fifty-five billion, five hundred twenty-three million, one hundred forty-five thousand, seven hundred thirty-seven".