14272
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 16
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 14
- Divisor Sum
- 28448
- Proper Divisor Sum (Aliquot Sum)
- 14176
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 7104
- Möbius Function
- 0
- Radical
- 446
- Omega Function (Ω)
- 7
- 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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 76
- 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
- Upper triangular region of the table A073345.at n=74A073429
- Number of plane binary trees of size n+3 and height n.at n=8A073774
- Theorems from propositional calculus, translated into decimal digits.at n=19A101273
- Number of partitions of n having no parts with multiplicity 9.at n=35A184644
- a(n) equals the coefficient of x^n in the (n+1)-th iteration of x*(1+x)/(1-x) for n>=1.at n=4A185524
- Number of (n+1) X (1+1) 0..6 arrays with every 2 X 2 subblock having the sum of the squares of the edge differences equal to 30, and no two adjacent values equal.at n=4A233885
- Number of (n+1)X(5+1) 0..6 arrays with every 2X2 subblock having the sum of the squares of the edge differences equal to 30, and no two adjacent values equal.at n=0A233889
- T(n,k)=Number of (n+1)X(k+1) 0..6 arrays with every 2X2 subblock having the sum of the squares of the edge differences equal to 30 (30 maximizes T(1,1)), and no two adjacent values equal.at n=10A233892
- T(n,k)=Number of (n+1)X(k+1) 0..6 arrays with every 2X2 subblock having the sum of the squares of the edge differences equal to 30 (30 maximizes T(1,1)), and no two adjacent values equal.at n=14A233892
- Triangle read by rows: coefficients of rook polynomials.at n=41A259985
- Number of Wilf-equivalence classes of square permutations of 2n things that avoid 123.at n=5A279201
- p-INVERT of the positive integers, where p(S) = 1 - 8*S^2.at n=6A290915
- Number T(n,k) of binary search trees of height k having n internal nodes; triangle T(n,k), n>=0, max(0,floor(log_2(n))+1)<=k<=n, read by rows.at n=41A335919
- Triangle read by row. The reduced triangle of the partition_triangle A355776.at n=38A356116
- Triangle read by row. The reduced triangle of the partition_triangle A355776.at n=42A356116
- Number of subsets of {1,2,...,n} such that no two elements differ by 2, 4, or 5.at n=26A375983
- Number of binary words of length n avoiding distance (i+1) between "1" digits if the i-th bit is set in the binary representation of n.at n=26A376091
- G.f. A(x) = Sum_{n>=0} a(n)*x^n where a(n) = Sum_{k=0..n-1} ( ([x^k] A(x)^n) (mod 2^n) ) for n > 0, with a(0) = 1.at n=12A376231
- T(n,k) is the number of permutations of [n] having exactly k pairs of integers i<j in [n] such that their cycle minima have opposite sorting order; triangle T(n,k), n>=0, 0<=k<=A125811(n)-1, read by rows.at n=59A381529
- Place a point on the integer coordinates, up to |n|, along all four axial directions on a Cartesian plane, and then join an infinite straight line between every pair of points: a(n) is the number of finite regions created in the resulting graph.at n=6A386560