8716
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 22
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 6
- Divisor Sum
- 15260
- Proper Divisor Sum (Aliquot Sum)
- 6544
- 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
- 4356
- Möbius Function
- 0
- Radical
- 4358
- 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
- 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
- Number of partially labeled trees with n nodes (5 of which are labeled).at n=2A000526
- Truncated square numbers: 7*n^2 + 4*n + 1.at n=35A005892
- Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 56 ones.at n=13A031824
- Triangle read by rows: T(n,k) is the number of partially labeled trees with n nodes, k of which are labeled, 0 <= k <= n.at n=33A034799
- Triangle of number of node labeled trees by number of nodes and number of labels.at n=26A034800
- Number of "connected animals" formed from n 4-gon or 6-gon connected truncated octahedra in the b.c.c. lattice, allowing only translation of the lattice.at n=4A038386
- a(n) = a(1) + a(2) + ... + a(n-1) - a(m) for n >= 4, where m = n - 1 - 2^p and p is the unique integer such that 2^p < n - 1 <= 2^(p+1), starting with a(1) = 1, a(2) = 3 and a(3) = 2.at n=14A049922
- Interprimes which are of the form s*prime, s=4.at n=35A075279
- Indices of primes which remain prime if any one digit is deleted (leading zeros allowed).at n=41A084375
- Triangle read by rows: T(n,k) is the number of Schroeder paths of length 2n having exactly k down steps hitting the x-axis.at n=39A101275
- Number of squares on infinite chessboard that a knight can reach in n moves from a fixed square.at n=35A118312
- Distinct values in A119842, in order of appearance.at n=17A119846
- Smallest number that can be written in exactly n ways as a sum of distinct repdigits of its decimal digits.at n=16A131367
- Record values in A132601.at n=43A132603
- a(n) = 7*n^2 + 4*n + 1.at n=36A135704
- Numbers n such that n^2 contains no digit less than 5.at n=35A175471
- a(1)=1. a(n+1) = Sum_{k=1..n} a(b(k,n)), where b(k,n) is the largest positive integer that, when written in binary, occurs as a substring in both binary k and binary n.at n=36A175491
- Number of ordered triples (w,x,y) with all terms in {-n, ..., -1, 1, ..., n} and 4w + x + y > 0.at n=13A211629
- Number of lower triangular n X n arrays colored with integers 0 upwards introduced in row major order, with no element equal to any horizontal, vertical, diagonal or antidiagonal neighbor, and containing the value n(n+1)/2-2.at n=15A211911
- Number A(n,k) of n X k chess tableaux; square array A(n,k), n>=0, k>=0, read by antidiagonals.at n=60A214020