Search a number
-
+
131516203361 = 1039707917881
BaseRepresentation
bin111101001111011111…
…0100000000101100001
3110120110120221100121212
41322132332200011201
54123321122001421
6140230120355505
712334044166214
oct1723676400541
9416416840555
10131516203361
1150859517164
12215a4615b95
13c52c04b09a
1465189c977b
15364b00de5b
hex1e9efa0161

131516203361 has 8 divisors (see below), whose sum is σ = 131668742400. Its totient is φ = 131363716320.

The previous prime is 131516203337. The next prime is 131516203381. The reversal of 131516203361 is 163302615131.

It is a sphenic number, since it is the product of 3 distinct primes.

It is a cyclic number.

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

It is a Duffinian number.

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

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

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 7346141 + ... + 7364021.

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

Almost surely, 2131516203361 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 25999.

The product of its (nonzero) digits is 9720, while the sum is 32.

Adding to 131516203361 its reverse (163302615131), we get a palindrome (294818818492).

The spelling of 131516203361 in words is "one hundred thirty-one billion, five hundred sixteen million, two hundred three thousand, three hundred sixty-one".

Divisors: 1 1039 7079 17881 7355081 18578359 126579599 131516203361