14692
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
- 6
- Divisor Sum
- 25718
- Proper Divisor Sum (Aliquot Sum)
- 11026
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 7344
- Möbius Function
- 0
- Radical
- 7346
- 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
- 164
- 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
- Composite numbers k such that the sum of the proper divisors of k not including 1, (Chowla's function, A048050) and their product (A007956) are both perfect squares.at n=36A064180
- Factorable subsets: the number of proper subsets S of {1,2,...,n} that can be expressed in the form S=A*B, where S is defined to be the set {a(i)*b(j)| a(i) in A, b(j) in B}.at n=25A068594
- Polynomial (1/3)*n^3 + (9/2)*n^2 + (85/6)*n - 2.at n=31A073775
- The PolyLog functional part of A008292 (the Eulerian numbers) is treated as a curvature to give a set of polynomial triangle sequence coefficients: p(x,n)=Sum[A008292(n,m)*x^(m-1),{m,0,n}]; q(x,n)=k from Solve[FullSimplify[ExpandAll[p[x, n]/(x - 1)^n]] - (1 + k/x^2) == 0, k].at n=50A146540
- Number of nondecreasing integer sequences of length 11 with sum zero and sum of absolute values 2n.at n=14A158145
- Number of n-digit 5th powers.at n=22A216655
- Number T(n,k) of tilings of a 5 X n rectangle with pentominoes of any shape and exactly k pentominoes of shape Y; triangle T(n,k), n>=0, read by rows.at n=13A247712
- Number of tilings of a 5 X n rectangle using n pentominoes of any but the Y shape.at n=6A247776
- Number of ways to remove n oranges from an infinite stack of oranges whose m-th layer is an m X (m+1) rectangle.at n=13A274594
- Number of semi-lone-child-avoiding rooted trees with n unlabeled vertices.at n=15A331934