8916
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 24
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 20832
- Proper Divisor Sum (Aliquot Sum)
- 11916
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 2968
- Möbius Function
- 0
- Radical
- 4458
- Omega Function (Ω)
- 4
- Little Omega Function (ω)
- 3
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
- 47
- 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
- a(n) = n*(31*n-1)/2.at n=24A022288
- Number of connected functions on n points with a loop of length 3.at n=10A029852
- McKay-Thompson series of class 27A for the Monster group.at n=29A058599
- Triangle of numbers {a(n,k), n >= 0, 0<=k<=n} defined by a(0,0)=1, a(n,0)=a(n-1,n-1), a(n,k)=a(n,k-1) + Sum_{i=0..k-1} a(n-1,i).at n=22A108041
- a(1)=1, a(n)=a(n-1)+n^2 if n odd, a(n)=a(n-1)+ n^5 if n is even.at n=6A140151
- Number of 5 X 5 arrays of squares of integers, symmetric about main diagonal, with all rows summing to n.at n=35A156385
- Number of binary strings of length n with equal numbers of 00100 and 10101 substrings.at n=14A164242
- Numbers that match polynomials over {0,1} that have a factor containing 3 as a coefficient; see Comments.at n=14A208181
- Number of ON cells at generation n of 2-D cellular automaton in which a cell is ON iff either 1, 2 or 3 of its eight neighbors were ON at previous generation, starting with a single ON cell.at n=66A246308
- L.g.f.: log( Sum_{n>=0} x^n/n! * Product_{k=1..n} (k^2 + 1) ).at n=5A262002
- Growth series for affine Coxeter group B_6.at n=11A267169
- Numbers k such that 7*10^k - 17 is prime.at n=21A280969
- Number of essentially simple rooted toroidal triangulations with n vertices.at n=5A308523
- Number of n X n 0..1 arrays with every element unequal to 0, 1, 3, 5, 6 or 8 king-move adjacent elements, with upper left element zero.at n=5A316421
- Number of nX6 0..1 arrays with every element unequal to 0, 1, 3, 5, 6 or 8 king-move adjacent elements, with upper left element zero.at n=5A316425
- T(n,k)=Number of nXk 0..1 arrays with every element unequal to 0, 1, 3, 5, 6 or 8 king-move adjacent elements, with upper left element zero.at n=60A316427
- Number of integer partitions of n whose multiplicities cover an initial interval of positive integers.at n=39A317081
- a(n) = n*2^(2*n-2) + n*binomial(2*n,n)/2.at n=6A339240
- a(n) is the least k such that A345468(k) = 2*n-1.at n=33A345469
- Numbers k such that there exists a pair of primes (p,q) with p+q = k such that p*q + k, p*q - k, p*q + A001414(k) and p*q - A001414(k) are all prime.at n=49A358132