Search a number
-
+
15301315713133 is a prime number
BaseRepresentation
bin1101111010101001110101…
…1111001101100001101101
32000011210101000000120002201
43132222131133031201231
54001144043310310013
652313154415021501
73136324603405342
oct336523537154155
960153330016081
1015301315713133
11496a2848a75aa
1218715b780a891
1386cba57c8468
143ac8326687c9
151b80505b93dd
hexdea9d7cd86d

15301315713133 has 2 divisors, whose sum is σ = 15301315713134. Its totient is φ = 15301315713132.

The previous prime is 15301315713109. The next prime is 15301315713191. The reversal of 15301315713133 is 33131751310351.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 12050604074404 + 3250711638729 = 3471398^2 + 1802973^2 .

It is a cyclic number.

It is not a de Polignac number, because 15301315713133 - 29 = 15301315712621 is a prime.

It is a junction number, because it is equal to n+sod(n) for n = 15301315713092 and 15301315713101.

It is a congruent number.

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

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

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

Almost surely, 215301315713133 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 42525, while the sum is 37.

The spelling of 15301315713133 in words is "fifteen trillion, three hundred one billion, three hundred fifteen million, seven hundred thirteen thousand, one hundred thirty-three".