14726
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 20
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 22800
- Proper Divisor Sum (Aliquot Sum)
- 8074
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 7128
- Möbius Function
- -1
- Radical
- 14726
- Omega Function (Ω)
- 3
- 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
- 133
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- 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) = floor(binomial(n,4)/4).at n=36A011850
- Number of n-node rooted identity trees of height at most 5.at n=21A038084
- Number of lattice paths from (0,0) to the line x+y=n that use the step set {(0,1),(1,0),(2,0),(3,0),...} and never pass below y=x.at n=14A089324
- Triangle read by rows: even-numbered rows of A106580.at n=62A106585
- Triangle read by rows: even-numbered rows of A106580.at n=63A106585
- Numerator of sum of reciprocals of first n 5-simplex numbers A000389.at n=31A118431
- First row sum of the 5 X 5 matrix M^n, where M = {{0, -1, 0, 0, 0}, {-1, 1, -1, 0, 0}, {0, -1, 1, -1, 0}, {0, 0, -1, 1, -1}, {0, 0, 0, -1, 1}}, n>=0.at n=14A122948
- First term in a sum partition of the even-indexed Fibonacci numbers.at n=7A132262
- Twice 13-gonal numbers: a(n) = n*(11*n - 9).at n=37A152997
- Define two triangular arrays by: B(0,0)=C(0,0)=1, B(0,r)=C(0,r)=0 for r>0, C(t,-1)=C(t,0); and for t,r >= 0, B(t+1,r)=C(t,r-1)+2C(t,r)-B(t,r), C(t+1,r)=B(t+1,r)+2B(t+1,r+1)-C(t,r). Sequence gives array B(t,r) read by rows.at n=28A177011
- Even-index Fibonacci partition triangle read by rows.at n=63A197956
- Expansion of 1/(1-x-x^2-x^3-x^5+x^8-x^9).at n=16A257792
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 65", based on the 5-celled von Neumann neighborhood.at n=27A270085
- Number of Motzkin meanders of length n with an even number of humps and an even number of peaks.at n=11A325921
- Digitally balanced numbers (A031443) whose squares and cubes are also digitally balanced.at n=4A353140
- a(n) = Product_{i=2..n} p(i) - p(n+1)^2, where p(i) is the i-th prime.at n=5A360510