Search a number
-
+
139167947665 = 561456288353
BaseRepresentation
bin1000000110011100001…
…1100101101110010001
3111022012212001020112001
42001213003211232101
54240003443311130
6143533300034001
713024466015515
oct2014703455621
9438185036461
10139167947665
115402575098a
1222b7b092901
131017b398c36
146a42d1c145
153947b676ca
hex20670e5b91

139167947665 has 8 divisors (see below), whose sum is σ = 169739267688. Its totient is φ = 109509204480.

The previous prime is 139167947641. The next prime is 139167947683. The reversal of 139167947665 is 566749761931.

It can be written as a sum of positive squares in 4 ways, for example, as 1094021776 + 138073925889 = 33076^2 + 371583^2 .

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

It is not a de Polignac number, because 139167947665 - 27 = 139167947537 is a prime.

It is a Duffinian number.

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

It is an unprimeable number.

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, 228143872 + ... + 228144481.

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

Almost surely, 2139167947665 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 456288419.

The product of its digits is 51438240, while the sum is 64.

The spelling of 139167947665 in words is "one hundred thirty-nine billion, one hundred sixty-seven million, nine hundred forty-seven thousand, six hundred sixty-five".

Divisors: 1 5 61 305 456288353 2281441765 27833589533 139167947665