Search a number
-
+
106804052131 = 7149102400817
BaseRepresentation
bin110001101111000000…
…1001000000010100011
3101012200100200000002111
41203132001020002203
53222213314132011
6121022021300151
710500463315120
oct1433601100243
9335610600074
10106804052131
1141328115187
1218848564657
13a0c13498aa
145252971747
152ba174a121
hex18de0480a3

106804052131 has 8 divisors (see below), whose sum is σ = 122880981600. Its totient is φ = 90931924608.

The previous prime is 106804052123. The next prime is 106804052141. The reversal of 106804052131 is 131250408601.

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

It is not a de Polignac number, because 106804052131 - 23 = 106804052123 is a prime.

It is a super-2 number, since 2×1068040521312 (a number of 23 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 = 106804052093 and 106804052102.

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

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

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

Almost surely, 2106804052131 is an apocalyptic number.

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

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

106804052131 is an evil number, because the sum of its binary digits is even.

The sum of its prime factors is 102400973.

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

The spelling of 106804052131 in words is "one hundred six billion, eight hundred four million, fifty-two thousand, one hundred thirty-one".

Divisors: 1 7 149 1043 102400817 716805719 15257721733 106804052131