8908
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 25
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 16632
- Proper Divisor Sum (Aliquot Sum)
- 7724
- 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
- 4160
- Möbius Function
- 0
- Radical
- 4454
- 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
- 140
- 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) = prime(n)*(prime(n+1)-1)/2.at n=31A014303
- Numbers k such that the continued fraction for sqrt(k) has period 76.at n=22A020415
- Numbers n such that 197*2^n-1 is prime.at n=24A050850
- Consider the array T(n, m) where the n-th row is the sequence of integer coefficients of A(x), where 1<=a(n)<=n, such that A(x)^(1/n) consists entirely of integer coefficients and where m is the (m+1)-th coefficient. This is the row sum of A to the first coefficient of one.at n=39A112285
- First differences of A006128.at n=28A138137
- Number of binary strings of length n with no substrings equal to 0000 0111 or 1001.at n=15A164442
- a(n) = (3*n+7)*(3*n+2)/2.at n=43A179436
- Inverse permutation to A190128.at n=7A190129
- Number of (n+2) X (2+2) 0..1 arrays with every 2 X 2 and 3X3 subblock diagonal maximum minus antidiagonal minimum nondecreasing horizontally and vertically.at n=11A253504
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 441", based on the 5-celled von Neumann neighborhood.at n=22A272223
- a(n) = Sum_{k=1..n} (k^2*floor(k/2)).at n=15A285188
- Numbers m > 0 that have a divisor d > 1 with binomial(m+d, d) == 1 mod m.at n=14A290040
- Number of nX3 0..1 arrays with every element equal to 0, 2, 3, 4 or 5 king-move adjacent elements, with upper left element zero.at n=6A298235
- Number of nX7 0..1 arrays with every element equal to 0, 2, 3, 4 or 5 king-move adjacent elements, with upper left element zero.at n=2A298239
- T(n,k)=Number of nXk 0..1 arrays with every element equal to 0, 2, 3, 4 or 5 king-move adjacent elements, with upper left element zero.at n=38A298240
- T(n,k)=Number of nXk 0..1 arrays with every element equal to 0, 2, 3, 4 or 5 king-move adjacent elements, with upper left element zero.at n=42A298240
- Number of (undirected) cycles in the n-triangular honeycomb obtuse knight graph.at n=5A308156
- Number of nX7 0..1 arrays with every element unequal to 0, 2, 3, 6, 7 or 8 king-move adjacent elements, with upper left element zero.at n=9A316732
- Number of n-step mirror-symmetrical self-avoiding walks on the square lattice.at n=15A323188
- a(n) is the number of overpartitions of n where overlined parts are not divisible by 3 and non-overlined parts are congruent to 1 modulo 3.at n=38A335754