Search a number
-
+
131466680707 = 615473940021
BaseRepresentation
bin111101001110000000…
…1100101100110000011
3110120100010202100022111
41322130001211212003
54123220432240312
6140221151120151
712332603230255
oct1723401454603
9416303670274
10131466680707
115083357204a
122158bb13057
13c5219cc03b
1465121b7cd5
1536469ca8a7
hex1e9c065983

131466680707 has 8 divisors (see below), whose sum is σ = 133866187472. Its totient is φ = 129075055200.

The previous prime is 131466680663. The next prime is 131466680749. The reversal of 131466680707 is 707086664131.

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

It is a cyclic number.

It is not a de Polignac number, because 131466680707 - 227 = 131332462979 is a prime.

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

It is a Duffinian number.

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

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

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

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

Almost surely, 2131466680707 is an apocalyptic number.

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

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

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

The sum of its prime factors is 3940629.

The product of its (nonzero) digits is 1016064, while the sum is 49.

The spelling of 131466680707 in words is "one hundred thirty-one billion, four hundred sixty-six million, six hundred eighty thousand, seven hundred seven".

Divisors: 1 61 547 33367 3940021 240341281 2155191487 131466680707