Search a number
-
+
1535001130141 is a prime number
BaseRepresentation
bin10110010101100101001…
…100100111010010011101
312102202002212102202220221
4112111211030213102131
5200122140242131031
63133100401241341
7215620521216523
oct26254514472235
95382085382827
101535001130141
11541a99136526
122095b0933251
13b19999447bb
1454419d8c313
1529de009ea11
hex1656532749d

1535001130141 has 2 divisors, whose sum is σ = 1535001130142. Its totient is φ = 1535001130140.

The previous prime is 1535001130121. The next prime is 1535001130153. The reversal of 1535001130141 is 1410311005351.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 1213568827641 + 321432302500 = 1101621^2 + 566950^2 .

It is a cyclic number.

It is not a de Polignac number, because 1535001130141 - 213 = 1535001121949 is a prime.

It is a congruent number.

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

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

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

Almost surely, 21535001130141 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 900, while the sum is 25.

Adding to 1535001130141 its reverse (1410311005351), we get a palindrome (2945312135492).

The spelling of 1535001130141 in words is "one trillion, five hundred thirty-five billion, one million, one hundred thirty thousand, one hundred forty-one".