Properties of the number 3816:
3816 = 2
3 × 3
2 × 53 is the 3286
th composite number and is not
squarefree.
3816 has 3 distinct prime factors, 24 divisors, 9
antidivisors and 1248
totatives.
3816 has a
Fibonacci digit product 144 in base 10.
3816 = 7
3 + 9
3 + 14
3 is the sum of 3 positive cubes in 1 way.
3816 = 955
2 - 953
2 = 479
2 - 475
2 = 321
2 - 315
2 = 165
2 - 153
2 = 115
2 - 97
2 = 71
2 - 35
2 is the difference of 2 nonnegative squares in 6 ways.
3816 is the difference of 2 positive
pentagonal numbers in 1 way.
3816 = 30
2 + 54
2 is the sum of 2 positive squares in 1 way.
3816 = 14
2 + 16
2 + 58
2 is the sum of 3 positive squares.
3816
2 = 2016
2 + 3240
2 is the sum of 2 positive squares in 1 way.
3816
2 is the sum of 3 positive squares.
3816 is a proper divisor of 107
2 - 1.
3816 = '381' + '6' is the concatenation of 2
semiprime numbers.
3816 is
palindromic in (at least) the following bases: 31, 71, and -41.
3816 in base 16 = ee8 and consists of only the digits '8' and 'e'.
3816 in base 19 = aag and consists of only the digits 'a' and 'g'.
3816 in base 31 = 3u3 and consists of only the digits '3' and 'u'.
3816 in base 43 = 22W and consists of only the digits '2' and 'W'.
3816 in base 61 = 11Y and consists of only the digits '1' and 'Y'.
Sequence numbers and descriptions below are taken from
OEIS.
A000567: Octagonal numbers: n*(3*n-2). Also called star numbers.
A014642: Even octagonal numbers: 4*n*(3*n-1).
A118807: Number of partitions of n having no parts with multiplicity 3.
A135190: Numbers n that raised to the powers from 1 to k (with k>=1) are multiple of the sum of their digits (n raised to k+1 must not be a multiple). Case k=5.
A138990: a(n) = Frobenius number for 4 successive primes = F[p(n),p(n+1),p(n+2),p(n+3)].
A139229: First differences of perfect numbers
A000396, divided by 2.
A173682: Number of ways of writing n as a sum of 9 nonnegative cubes.
A219047: Numbers n such that 3^n - 28 is prime.
A257211: Numbers n such that the decimal expansions of both n and n^2 have 1 as smallest digit and 8 as largest digit.
A269656: T(n,k)=Number of length-n 0..k arrays with no adjacent pair x,x+1 repeated.