14494
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 22
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 21744
- Proper Divisor Sum (Aliquot Sum)
- 7250
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 7246
- Möbius Function
- 1
- Radical
- 14494
- Omega Function (Ω)
- 2
- 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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 120
- Smith Number
- yes
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- yes
- Squarefree Number
- yes
- 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) = number of integer strings s(0),...,s(n) counted by array T in A026386 that have s(n)=0; also a(n) = T(2n,n).at n=6A026387
- T(n,[ n/2 ]), where T is the array in A026386.at n=13A026392
- Self-convolution of array T given by A026374.at n=7A026946
- Self-convolution of array T given by A026386.at n=7A026951
- Multiplicity of highest weight (or singular) vectors associated with character chi_94 of Monster module.at n=39A034482
- a(0)=1; for n>0, a(n) = 2*5^(n-1) - (1/2)*Sum_{i=1..n-1} a(i)*a(n-i).at n=7A085362
- Triangle read by rows: T(n,k) is the number of Schroeder paths of length 2n and having k peaks at odd height.at n=37A101894
- Let l(n) be the number of letters when n is written in French; sequence gives values of n where l(n) sets a new record.at n=38A105873
- n+p(n)+p(p(n)) is a palindrome, where p(n) denotes the n-th prime.at n=25A116037
- Number of planar n X n X n binary triangular grids symmetric both under 120 degree rotation and reflection with every one adjacent to exactly 1 other one.at n=19A153984
- Triangle interpolating the swinging factorial (A056040) restricted to even indices with its binomial transform. Same as interpolating bilateral Schroeder paths (A026375) with the central binomial coefficients (A000984).at n=29A163841
- Triangle read by rows: number of set partitions of n elements with k connectors, 0<=k<n.at n=56A185982
- Number of (1+1) X (n+1) 0..2 arrays with every element next to itself plus and minus one within the range 0..2 horizontally, diagonally or antidiagonally, with no adjacent elements equal.at n=11A232516
- Number of set partitions of [n] having exactly one pair (m,m+1) such that m is in some block b and m+1 is in block b+1.at n=10A271788
- Number of unlabeled loopless multigraphs with n nodes of degree 3 or less.at n=10A333894