Search a number
-
+
15147368106077 is a prime number
BaseRepresentation
bin1101110001101100010101…
…1111101100100001011101
31222122002000010102211101102
43130123011133230201131
53441133302213343302
652114334351322445
73122234621342534
oct334330537544135
958562003384342
1015147368106077
11490aa6544a889
1218477b2b20425
1385b51043cc4c
143a51ca8c131b
151b4040163702
hexdc6c57ec85d

15147368106077 has 2 divisors, whose sum is σ = 15147368106078. Its totient is φ = 15147368106076.

The previous prime is 15147368105999. The next prime is 15147368106103. The reversal of 15147368106077 is 77060186374151.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 14676361788676 + 471006317401 = 3830974^2 + 686299^2 .

It is an emirp because it is prime and its reverse (77060186374151) is a distict prime.

It is a cyclic number.

It is not a de Polignac number, because 15147368106077 - 212 = 15147368101981 is a prime.

It is a congruent number.

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

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

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

Almost surely, 215147368106077 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 5927040, while the sum is 56.

The spelling of 15147368106077 in words is "fifteen trillion, one hundred forty-seven billion, three hundred sixty-eight million, one hundred six thousand, seventy-seven".