14309
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 17
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 14700
- Proper Divisor Sum (Aliquot Sum)
- 391
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 13920
- Möbius Function
- 1
- Radical
- 14309
- Omega Function (Ω)
- 2
- 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
- 76
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- yes
- 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
- no
- Odd
- yes
Appears in sequences
- a(n) = n*(17*n + 1)/2.at n=41A022275
- Composite and every divisor (except 1) contains the digit 4.at n=3A062670
- Number of classes of compositions of n equivalent under reflection or cycling.at n=18A091696
- Triangular array read by rows: T(n,1) = T(n,n) = 1, T(n,k) = 3*T(n-1,k-1) + 2*T(n-1,k).at n=39A119725
- Triangle, read by rows, where T(n,k) = n*T(n-1,k-1) + T(n-1,k-2) for n>0 and k>1, with T(n,0) = T(n-1,n-1) and T(n,1) = n*T(n-1,0) for n>0 and T(0,0) = 1.at n=35A132005
- Triangle, read by rows, where T(n,k) = n*T(n-1,k-1) + T(n-1,k-2) for n>0 and k>1, with T(n,0) = T(n-1,n-1) and T(n,1) = n*T(n-1,0) for n>0 and T(0,0) = 1.at n=36A132005
- Column 0 and main diagonal (offset) of triangle A132005.at n=8A132006
- Positive numbers y such that y^2 is of the form x^2+(x+449)^2 with integer x.at n=8A159589
- Numbers m such that A006218(m) is a perfect square.at n=35A175345
- Numbers n such that 2*n + prime(n) is a square.at n=35A256246
- Number of strictly-convex unit-sided polygons with all internal angles equal to a multiple of Pi/n, ignoring rotational and reflectional copies.at n=18A361635