14445
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
- 2
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 25920
- Proper Divisor Sum (Aliquot Sum)
- 11475
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 7632
- Möbius Function
- 0
- Radical
- 1605
- Omega Function (Ω)
- 5
- 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
- 71
- 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
- If F(n) is the n-th Fibonacci number, then a(2n) = (F(2n+1) + F(n+2))/2 and a(2n+1) = (F(2n+2) + F(n+1))/2.at n=21A001224
- a(n) = (F(2*n-1) + F(n+1))/2 where F(n) is a Fibonacci number.at n=12A005207
- Numerators of continued fraction convergents to sqrt(500).at n=7A041954
- Number of distinct ways to tile a 2 X n rectangle with dominoes (solutions are identified if they are rotations or reflections of each other).at n=21A060312
- Second binomial transform of the Catalan numbers.at n=7A064613
- Number of incongruent ways to tile a 3 X 2n room with 1x2 Tatami mats. At most 3 Tatami mats may meet at a point.at n=21A068928
- Non-balanced numbers in A015771.at n=26A078549
- Duplicate of A001224.at n=22A102526
- (p*q - 1)/2 where p and q are consecutive odd primes.at n=37A102770
- Number of polyominoes that can be formed from n regular unit pentagons (or polypents of order n).at n=8A103465
- Number of polyominoes consisting of 9 regular unit n-gons.at n=2A120103
- Triangle read by rows: row n is the first row of the matrix M[n]^(n-1), where M[n] is the n X n tridiagonal matrix with main diagonal (3,4,4,...) and super- and subdiagonals (1,1,1,...).at n=28A124574
- Numbers k for which nontrivial positive magic squares of exactly 9 different orders with magic sum k exist. For a definition of nontrivial positive magic squares, see A125005.at n=33A125016
- Integers k such that 10^k + 87 is a prime number.at n=9A135117
- 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), (0, 0, 1), (0, 1, -1), (1, 0, -1), (1, 1, -1)}.at n=9A149092
- 3 times 13-gonal (or tridecagonal) numbers: a(n) = 3*n*(11*n - 9)/2.at n=30A153875
- a(n) = (6 + 10*n + 5*n^2 + n^3)/2.at n=29A164845
- Riordan array (f(x), x*f(x)) where f(x) is the g.f. of A064613.at n=28A171568
- Numbers k for which 5*k-4, 5*k-2, 5*k+2, and 5*k+4 are primes.at n=29A178082
- Constant term of the reduction of the polynomial p(n,x)=(1/2)((x+1)^n+(x-1)^n) by x^2->x+1.at n=12A192352