8416
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 19
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 16632
- Proper Divisor Sum (Aliquot Sum)
- 8216
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 4192
- Möbius Function
- 0
- Radical
- 526
- Omega Function (Ω)
- 6
- Little Omega Function (ω)
- 2
Special
- Factorial
- no
- Catalan Number
- no
- Bell Number
- no
- Motzkin Number
- no
- Primorial
- no
Figurate Numbers
- Fibonacci Number
- no
- Triangular Number
- no
- Perfect Square
- no
- Perfect Cube
- no
- Pentagonal Number
- no
- Hexagonal Number
- no
- Lucas Number
- no
- Tetrahedral Number
- no
- Pell Number
- no
- Tribonacci Number
- no
- Pronic Number
- no
Recreational
- Happy Number
- no
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 83
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- Squarefree Number
- no
- Prime Power
- no
- Prime Factorization
- no
- Twin Prime
- no
- Mersenne Prime
- no
- Sophie Germain Prime
- no
- Safe Prime
- no
- Powerful Number
- no
- Achilles Number
- no
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- yes
- Odd
- no
Appears in sequences
- Number of switching networks (see Harrison reference for precise definition).at n=2A000808
- Self-convolution of composite numbers.at n=23A023648
- Number of partitions of n into parts not of the form 25k, 25k+6 or 25k-6. Also number of partitions with at most 5 parts of size 1 and differences between parts at distance 11 are greater than 1.at n=33A036005
- Consider the sequence {b(m)} of composite numbers (excluding 1); sequence gives values of b(m) where gcd(m, b(m)) increases.at n=25A058012
- Centered 15-gonal numbers: a(n) = (15*n^2 - 15*n + 2)/2.at n=33A069128
- Expansion of psi(x^3)^2 / f(-x^2) in powers of x where psi(), f() are Ramanujan theta functions.at n=55A097196
- Number of compositions of n such that each part is adjacent to an equal part.at n=25A114901
- Multiples of 16 containing a 16 in their decimal representation.at n=36A121036
- a(n) = n*(8*n+7).at n=32A139278
- Positive integers of the form (7*m^2+1)/11.at n=20A179370
- Let S denote the palindromes in the language {0,1,2,...,n-1}*; a(n) = number of words of length 4 in the language SS.at n=15A187277
- Triangular array: (1/2)*A193850.at n=40A193852
- Triangular array: (1/2)*A193851.at n=40A193853
- a(n) = Fibonacci(n) + n^3.at n=18A212272
- 6^n mod 10000.at n=17A216128
- Number of 2 X n 0..2 arrays with antidiagonals unimodal and rows and diagonals nondecreasing.at n=14A224000
- Numbers of the form (5^j + 7^k)/2, for j and k >= 0.at n=36A226792
- Number of (n+1) X (2+1) 0..4 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 4 (constant-stress 1 X 1 tilings).at n=4A234558
- Number of (n+1) X (5+1) 0..4 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 4 (constant-stress 1 X 1 tilings).at n=1A234561
- T(n,k) is the number of (n+1) X (k+1) 0..4 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 4 (constant-stress 1 X 1 tilings).at n=16A234564