14409
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 18
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 6
- Divisor Sum
- 20826
- Proper Divisor Sum (Aliquot Sum)
- 6417
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 9600
- Möbius Function
- 0
- Radical
- 4803
- 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
- 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
- no
- Odd
- yes
Appears in sequences
- Expansion of Product_{m>=1} (1 + q^m)^m; number of partitions of n into distinct parts, where n different parts of size n are available.at n=19A026007
- Denominators of continued fraction convergents to sqrt(267).at n=8A041501
- Last odd terms from generation 2 onwards.at n=8A048457
- Odd numbers in sorted order from generation 2 onwards.at n=29A048462
- a(n+1) = 3*a(n-2) + 2*a(n-1), a(n)=x^n+y^n+z^n.at n=15A072329
- Numbers n such that z(n) and z(n+1) are both prime, where z(n) = a^d + b^d + c^d + ..., where a*b*c* ... is the prime factorization of n and d is the largest digit of n.at n=15A109280
- Terms in A112039 that are divisible by 3, divided by 3.at n=25A112040
- Ceiling((8*n+1/n)^n).at n=2A197768
- Number of nX5 0..1 arrays with every element equal to 0, 2, 3, 5, 6 or 8 king-move adjacent elements, with upper left element zero.at n=6A299455
- Number of nX7 0..1 arrays with every element equal to 0, 2, 3, 5, 6 or 8 king-move adjacent elements, with upper left element zero.at n=4A299457
- T(n,k)=Number of nXk 0..1 arrays with every element equal to 0, 2, 3, 5, 6 or 8 king-move adjacent elements, with upper left element zero.at n=59A299458
- T(n,k)=Number of nXk 0..1 arrays with every element equal to 0, 2, 3, 5, 6 or 8 king-move adjacent elements, with upper left element zero.at n=61A299458
- a(n) = 14*2^n + 73.at n=10A305266
- Terms k of A228058 such that gcd(k - A048250(k), A162296(k) - k) = A162296(k) - k.at n=24A325376
- Number of edges in an equilateral triangle when n internal equilateral triangles are drawn between the 3n points that divide each side into n+1 equal parts.at n=49A357008
- Number of ways to tile an n X n square using rectangles with distinct height X width dimensions.at n=4A360256
- Number of integer partitions of n such that (length) * (maximum) > 2*n.at n=35A361907
- Square array read by ascending antidiagonals: T(n,k) = [x^k] 1/(1 - x) * Legendre_P(k, (1 + x)/(1 - x))^n for n, k >= 0.at n=31A364113
- a(n) = [x^n] 1/(1 - x) * Legendre_P(n, (1 + x)/(1 - x))^4 for n >= 0.at n=3A364115
- a(n) = [x^n] 1/(1 - x) * Legendre_P(n, (1 + x)/(1 - x))^(n+1) for n >= 0.at n=3A364117