14125
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 13
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 17784
- Proper Divisor Sum (Aliquot Sum)
- 3659
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 11200
- Möbius Function
- 0
- Radical
- 565
- 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
- 102
- 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
- Numbers k such that the continued fraction for sqrt(k) has period 75.at n=13A020414
- Triangle of numbers relating two simple context-free grammars (A052709 and A052705).at n=42A073152
- Subdiagonal of array of n-gonal numbers A081422.at n=24A081423
- a(n) = floor(C(n+6,6)/C(n+2,2)).at n=43A084626
- Numbers n that are the hypotenuse of exactly 10 distinct integer-sided right triangles, i.e., n^2 can be written as a sum of two squares in 10 ways.at n=29A097225
- G.f.: A(x) = INV(x*(1-x) - x^2*INV(x*(1-x)^2 - x^2*INV(x*(1-x)^3 - x^2*INV(x*(1-x)^4 - x^2*INV(x*(1-x)^5 - ...))))), where INV(F(x)) = series reversion of F(x).at n=7A196708
- Number of length 2+2 0..n arrays with some pair in every consecutive three terms totalling exactly n.at n=21A245871
- a(n) = A266196(A000079(n)); indices of powers of 2 in A266195.at n=31A266186
- Number of length-n 0..4 arrays with no repeated value differing from the previous repeated value by other than plus two, zero or minus 1.at n=5A269615
- T(n,k)=Number of length-n 0..k arrays with no repeated value differing from the previous repeated value by other than plus two, zero or minus 1.at n=41A269619
- Number of length-6 0..n arrays with no repeated value differing from the previous repeated value by other than plus two, zero or minus 1.at n=3A269622
- Expansion of x*(1 - 2*x + x^2 + 7*x^3 - x^4)/((1 - x)^4*(1 + x)^3).at n=49A292551
- Number of n X 7 0..1 arrays with every element equal to 1, 2 or 4 horizontally, diagonally or antidiagonally adjacent elements, with upper left element zero.at n=4A302277
- T(n,k) = number of n X k 0..1 arrays with every element equal to 1, 2 or 4 horizontally, diagonally or antidiagonally adjacent elements, with upper left element zero.at n=59A302278
- Number of 5 X n 0..1 arrays with every element equal to 1, 2 or 4 horizontally, diagonally or antidiagonally adjacent elements, with upper left element zero.at n=6A302282
- Number of partitions of n with exactly four part sizes.at n=32A365630
- G.f. A(x) satisfies A(x) = 1 / ((1 + x) * (1 - x * A(x^3))).at n=44A367693