Search a number
-
+
106876714051 = 149371585207
BaseRepresentation
bin110001110001001011…
…0010011110001000011
3101012212102101121111201
41203202112103301003
53222340414322201
6121033134522031
710502335036342
oct1434226236103
9335772347451
10106876714051
1141365134158
1218868966317
13a10340ac03
14525c487b59
152ba7cee801
hex18e2593c43

106876714051 has 4 divisors (see below), whose sum is σ = 106948300752. Its totient is φ = 106805127352.

The previous prime is 106876714039. The next prime is 106876714069. The reversal of 106876714051 is 150417678601.

It is a semiprime because it is the product of two primes.

It is a cyclic number.

It is not a de Polignac number, because 106876714051 - 215 = 106876681283 is a prime.

It is a super-2 number, since 2×1068767140512 (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 = 106876713992 and 106876714010.

It is not an unprimeable number, because it can be changed into a prime (106876714081) 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 3 ways as a sum of consecutive naturals, for example, 35791111 + ... + 35794096.

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

Almost surely, 2106876714051 is an apocalyptic number.

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

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

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

The sum of its prime factors is 71586700.

The product of its (nonzero) digits is 282240, while the sum is 46.

The spelling of 106876714051 in words is "one hundred six billion, eight hundred seventy-six million, seven hundred fourteen thousand, fifty-one".

Divisors: 1 1493 71585207 106876714051