14024
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 11
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 26310
- Proper Divisor Sum (Aliquot Sum)
- 12286
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 7008
- Möbius Function
- 0
- Radical
- 3506
- Omega Function (Ω)
- 4
- 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
- 58
- 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 compositions of n into 4 ordered relatively prime parts.at n=44A000742
- Number of strict 3rd-order maximal independent sets in cycle graph.at n=44A007392
- Base 9 digits are, in order, the first n terms of the periodic sequence with initial period 2,1.at n=4A037494
- Base-9 palindromes that start with 2.at n=31A043029
- Triangle read by rows: T(n,k) (0 <= k <= n) is the number of Delannoy paths of length n, having k return steps to the line y = x from the line y = x+1 or from the line y = x-1 (i.e., E steps from the line y = x+1 to the line y = x or N steps from the line y = x-1 to the line y = x).at n=31A110107
- T(n,k)=Number of n-step one or two space at a time bishop's tours on a kXk board summed over all starting positions.at n=61A187046
- Number of 7-step one or two space at a time bishop's tours on an n X n board summed over all starting positions.at n=4A187051
- A014486-codes for the compact representation of Beanstalk-tree, growing by two natural numbers at time, starting from the tree of one internal node (1) and two leaves (3 and 2), with the larger numbers coming to the left hand side.at n=6A218782
- Numbers whose arithmetic derivatives are a permutation of their digits.at n=25A225902
- Number of length n+5 0..1 arrays with every six consecutive terms having the maximum of some three terms equal to the minimum of the remaining three terms.at n=13A250329
- Number of (n+2) X (1+2) 0..3 arrays with every 3 X 3 subblock row, column, diagonal and antidiagonal sum not equal to 2 3 4 6 or 7.at n=7A252262
- T(n,k)=Number of (n+2)X(k+2) 0..3 arrays with every 3X3 subblock row, column, diagonal and antidiagonal sum not equal to 2 3 4 6 or 7.at n=28A252269
- T(n,k)=Number of (n+2)X(k+2) 0..3 arrays with every 3X3 subblock row, column, diagonal and antidiagonal sum not equal to 2 3 4 6 or 7.at n=35A252269
- Palindromic numbers in bases 3 and 9 written in base 10.at n=47A259386
- Number of length n arrays of permutations of 0..n-1 with each element moved by -7 to 7 places and the median of every three consecutive elements nondecreasing.at n=8A263596
- Numbers k such that 2*10^k + 93 is prime.at n=25A275523
- Number of decagons that can be formed with perimeter n.at n=39A288256
- Number of self-avoiding polygons with perimeter n and sides = 1 that have vertex angles from the set 0, +-Pi/6, +-*Pi/3, +-Pi/2, +-2*Pi/3, +-5*Pi/6, not counting rotations and reflections as distinct.at n=9A316192
- Numbers k for which phi(k) = phi(k''), where phi is the Euler totient function (A000010) and k'' the second arithmetic derivative of k (A068346).at n=30A352331
- a(n) = number of subsets S of {1,2,...,n} having more than 2 elements such that (sum of least three elements of S) = max(S).at n=19A357287