Search a number
-
+
13501303501531 = 115311709716827
BaseRepresentation
bin1100010001111000010001…
…1001100011001011011011
31202210201020001110222110111
43010132010121203023123
53232201132144022111
644414225130225151
72562302613144046
oct304360431431333
952721201428414
1013501303501531
11433596393718a
1216207872851b7
1376c223b98b71
143496763dbc5d
151862ee94ca21
hexc47846632db

13501303501531 has 4 divisors (see below), whose sum is σ = 13513013219512. Its totient is φ = 13489593783552.

The previous prime is 13501303501379. The next prime is 13501303501547. The reversal of 13501303501531 is 13510530310531.

It is a semiprime because it is the product of two primes.

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-13501303501531 is a prime.

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

It is a Duffinian number.

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

It is not an unprimeable number, because it can be changed into a prime (13501303505531) by changing a digit.

It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 5854857261 + ... + 5854859566.

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

Almost surely, 213501303501531 is an apocalyptic number.

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

13501303501531 is a wasteful number, since it uses less digits than its factorization.

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

The sum of its prime factors is 11709717980.

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

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

Divisors: 1 1153 11709716827 13501303501531