Search a number
-
+
13143231503531 is a prime number
BaseRepresentation
bin1011111101000010010110…
…1001010001110010101011
31201112110222101211210111122
42333100211221101302223
53210314314231103111
643541530040445455
72524365346320653
oct277204551216253
951473871753448
1013143231503531
1142080165a4308
1215832b577988b
1374452ab9937c
143361c88bd363
1517bd43e2acdb
hexbf425a51cab

13143231503531 has 2 divisors, whose sum is σ = 13143231503532. Its totient is φ = 13143231503530.

The previous prime is 13143231503497. The next prime is 13143231503683. The reversal of 13143231503531 is 13530513234131.

It is a weak prime.

It is a cyclic number.

It is not a de Polignac number, because 13143231503531 - 210 = 13143231502507 is a prime.

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

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

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

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

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

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

Almost surely, 213143231503531 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 48600, while the sum is 35.

Adding to 13143231503531 its reverse (13530513234131), we get a palindrome (26673744737662).

The spelling of 13143231503531 in words is "thirteen trillion, one hundred forty-three billion, two hundred thirty-one million, five hundred three thousand, five hundred thirty-one".