Search a number
-
+
15031301435131 is a prime number
BaseRepresentation
bin1101101010111011111101…
…1000011110111011111011
31222012222102020112000222211
43122232333120132323323
53432233101131411011
651545141243555551
73110655443044012
oct332567730367373
958188366460884
1015031301435131
114875814882033
12182920052bbb7
138505a4102b27
1439d739ad5a79
151b0eea663b21
hexdabbf61eefb

15031301435131 has 2 divisors, whose sum is σ = 15031301435132. Its totient is φ = 15031301435130.

The previous prime is 15031301435057. The next prime is 15031301435141. The reversal of 15031301435131 is 13153410313051.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 15031301435131 - 227 = 15031167217403 is a prime.

It is a super-2 number, since 2×150313014351312 (a number of 27 digits) contains 22 as substring.

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

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

It is a pernicious number, because its binary representation contains a prime number (31) of ones.

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

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

Almost surely, 215031301435131 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 8100, while the sum is 31.

Adding to 15031301435131 its reverse (13153410313051), we get a palindrome (28184711748182).

The spelling of 15031301435131 in words is "fifteen trillion, thirty-one billion, three hundred one million, four hundred thirty-five thousand, one hundred thirty-one".