8477
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 26
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 6
- Divisor Sum
- 9918
- Proper Divisor Sum (Aliquot Sum)
- 1441
- 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
- 7224
- Möbius Function
- 0
- Radical
- 1211
- Omega Function (Ω)
- 3
- 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
- no
- Odd
- yes
Appears in sequences
- Number of triangulations of cyclic 3-polytope C(3,n+3).at n=6A007815
- Partial sums of A001935; at one time this was conjectured to agree with A007478.at n=32A014605
- a(n) = s(1)s(n) + s(2)s(n-1) + ... + s(k)s(n+1-k), where k = [ (n+1)/2 ], s = A000201 (lower Wythoff sequence).at n=32A024685
- Trace of Vandermonde matrix of numbers 1,2,...,n, i.e., the matrix A with A[i,j] = i^(j-1), 1 <= i <= n, 1 <= j <= n.at n=5A060946
- Numbers k > 1 such that, in base 4, k and k^2 contain the same digits in the same proportion.at n=24A061658
- Triangle read by rows: The n-th row is constructed by forming the partial sums of the previous row, reading from the right and if n is a triangular number repeating the final term.at n=37A099964
- Square of the (3,1)-entry of the 3 X 3 matrix M^n, where M = [1,0,0; 1,1,0; 1,i,1].at n=13A125641
- a(n) = a(n-1) + 5*a(n-2) for n >= 2, a(0)=1, a(1)=2.at n=9A133407
- Numbers n such that n!8 + 2 is prime.at n=45A204663
- Sum_{0<j<k<=n} (k^4-j^4).at n=4A206811
- Triangle defined by g.f.: A(x,y) = exp( Sum_{n>=1} x^n/n * Sum_{k=0..n} binomial(n, k)^n * y^k ), as read by rows.at n=22A209424
- Triangle defined by g.f.: A(x,y) = exp( Sum_{n>=1} x^n/n * Sum_{k=0..n} binomial(n, k)^n * y^k ), as read by rows.at n=26A209424
- Number of (w,x,y) with all terms in {0,...,n} and w<=x+y and x<=y.at n=26A212983
- a(n) = 1 + n + ((n-1)*n^2)/2.at n=26A218152
- a(n) = (n + 1)*(20*n^2 + 19*n + 6)/6.at n=13A220084
- a(n) = n*(7*n^2-12*n+7)/2.at n=14A226451
- Triangle defined by g.f. A(x,y) = exp( Sum_{n>=1} x^n/n * Sum_{k=0..n} binomial(n, k)^(k+1) * y^k ), as read by rows.at n=26A228899
- Number of length 3+1 0..n arrays with the sum of the squares of adjacent differences multiplied by some arrangement of +-1 equal to zero.at n=31A250278
- Define g(k) = min(n: n >= 0, 2^n + k prime). Then a(n) = min(odd k: g(k) = n).at n=25A260350
- Numbers k such that 4*10^k - 99 is prime.at n=20A278960