Search a number
-
+
106807615147 = 172369576523
BaseRepresentation
bin110001101111000111…
…0101101111010101011
3101012200121101000122001
41203132032231322223
53222220222141042
6121022225511431
710500535514662
oct1433616557253
9335617330561
10106807615147
114132a129122
12188497a2577
13a0c1cc659c
14525321bdd9
152ba1c00bb7
hex18de3adeab

106807615147 has 6 divisors (see below), whose sum is σ = 113459992868. Its totient is φ = 100524813984.

The previous prime is 106807615141. The next prime is 106807615169. The reversal of 106807615147 is 741516708601.

It is not a de Polignac number, because 106807615147 - 223 = 106799226539 is a prime.

It is a super-2 number, since 2×1068076151472 (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 = 106807615097 and 106807615106.

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

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

It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 184787973 + ... + 184788550.

Almost surely, 2106807615147 is an apocalyptic number.

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

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

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

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

The sum of its prime factors is 369576557 (or 369576540 counting only the distinct ones).

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

The spelling of 106807615147 in words is "one hundred six billion, eight hundred seven million, six hundred fifteen thousand, one hundred forty-seven".

Divisors: 1 17 289 369576523 6282800891 106807615147