Search a number
-
+
13251501035131 = 30894289899979
BaseRepresentation
bin1100000011010101101100…
…0000110000111001111011
31201220211102220001212111111
43000311123000300321323
53214103033231111011
644103353332341151
72535250356210022
oct300653300607173
951824386055444
1013251501035131
114249a25960947
1215a0290a747b7
137517c3a0c778
1433b539d298b9
1517ea7e152121
hexc0d5b030e7b

13251501035131 has 4 divisors (see below), whose sum is σ = 13255790938200. Its totient is φ = 13247211132064.

The previous prime is 13251501035093. The next prime is 13251501035177. The reversal of 13251501035131 is 13153010515231.

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

It is a cyclic number.

It is not a de Polignac number, because 13251501035131 - 221 = 13251498937979 is a prime.

It is a super-2 number, since 2×132515010351312 (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 = 13251501035093 and 13251501035102.

It is not an unprimeable number, because it can be changed into a prime (13251501036131) 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, 2144946901 + ... + 2144953078.

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

Almost surely, 213251501035131 is an apocalyptic number.

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

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

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

The sum of its prime factors is 4289903068.

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

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

Divisors: 1 3089 4289899979 13251501035131