Search a number
-
+
131617671070 = 2513161767107
BaseRepresentation
bin111101010010100000…
…1100100011110011110
3110120201122212110011011
41322211001210132132
54124023110433240
6140244143245434
712336415513354
oct1724501443636
9416648773134
10131617671070
1150900820376
12216125a987a
13c547086952
14652827d7d4
153654da36ea
hex1ea506479e

131617671070 has 8 divisors (see below), whose sum is σ = 236911807944. Its totient is φ = 52647068424.

The previous prime is 131617671047. The next prime is 131617671103. The reversal of 131617671070 is 70176716131.

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

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

It is a congruent number.

It is an unprimeable number.

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 3 ways as a sum of consecutive naturals, for example, 6580883544 + ... + 6580883563.

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

Almost surely, 2131617671070 is an apocalyptic number.

131617671070 is a gapful number since it is divisible by the number (10) formed by its first and last digit.

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

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

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

The sum of its prime factors is 13161767114.

The product of its (nonzero) digits is 37044, while the sum is 40.

The spelling of 131617671070 in words is "one hundred thirty-one billion, six hundred seventeen million, six hundred seventy-one thousand, seventy".

Divisors: 1 2 5 10 13161767107 26323534214 65808835535 131617671070