14144
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 14
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 28
- Divisor Sum
- 32004
- Proper Divisor Sum (Aliquot Sum)
- 17860
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 6144
- Möbius Function
- 0
- Radical
- 442
- Omega Function (Ω)
- 8
- 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
- 120
- 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
- Number of ways of writing n as a sum of 6 squares.at n=30A000141
- Number of nonequivalent dissections of an n-gon into (n-3) polygons by nonintersecting diagonals rooted at a cell up to rotation.at n=7A003442
- Number of walks on square lattice.at n=12A005565
- Theta series of D_6 lattice.at n=15A008428
- a(n) contains n digits (either '1' or '4') and is divisible by 2^n.at n=4A053314
- Numbers k for which phi(k) + anti-phi(k) = k.at n=29A066418
- Triangle read by rows: T(n, k) = binomial(2*n+1, n-k)^2*(2*k+1)/(2*n+1).at n=42A067802
- Least m such that A081355(m)=LD(m,m^2)=n, where LD(x,y) denotes the Levenshtein distance between x and y in decimal representation.at n=9A081356
- (n / product of digits of n) is a semiprime.at n=36A085773
- Antidiagonal sums of triangle A099602, in which row n equals the inverse binomial transform of column n of the triangle of trinomial coefficients (A027907).at n=17A099604
- Least n-digit number m whose square contains only digits not appearing in m.at n=4A110815
- Triangle read by rows: T(n,k) is the number of Grand Dyck paths of semilength n that cross the x-axis k times (n>=1, k>=0).at n=37A118920
- Numerators of reduced forms of fractions obtained by performing the first n divisions shown below.at n=9A120031
- Numbers n such that twice the sum of the prime factors of n equals the product of the digits of n.at n=24A125309
- Row sums of triangle A144825.at n=33A144826
- Smallest x >= 0 such that the Euler polynomial x^2 + x + 41 has a prime divisor of multiplicity n.at n=3A145294
- Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 0), (-1, 0, 1), (0, 1, -1), (1, 0, -1), (1, 0, 0)}.at n=10A148302
- a(n) = 49*n^2 - n.at n=16A157923
- a(n) = 289*n^2 - 17.at n=6A158587
- Number of (n+1) X 5 binary arrays with every 2 X 2 subblock nonsingular.at n=4A183683