14451
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 15
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 19272
- Proper Divisor Sum (Aliquot Sum)
- 4821
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 9632
- Möbius Function
- 1
- Radical
- 14451
- 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
- 45
- 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
- Semiprimes of the form 2*n + 1, where n is a square.at n=37A111351
- Expansion of (1-4x+12x^2-16x^3+8x^4)/(1-x)^5.at n=25A119327
- Numbers k such that the numerator of Sum_{j=1..k} k^2/(2*j*(j+k)) is prime.at n=47A125745
- a(n) = 50*n^2 + 1.at n=16A157916
- Number of Level 1 hexagonal polyominoes with cheesy blocks and n cells.at n=7A167011
- Numbers k such that 9^k - 3^k - 1 is prime.at n=18A265481
- a(n) is the sum of A023896(k) over the totatives of n.at n=52A307997
- Array read by antidiagonals: T(m,n) is the number of (non-null) connected induced subgraphs in the rook graph K_m X K_n.at n=29A360873
- Array read by antidiagonals: T(m,n) is the number of (non-null) connected induced subgraphs in the rook graph K_m X K_n.at n=34A360873
- Number of (non-null) connected induced subgraphs in the 2 X n rook graph.at n=6A360874
- Array read by antidiagonals: T(m,n) is the number of partitions of the vertices of the grid graph P_m X P_n into total dominating sets.at n=47A392413
- Array read by antidiagonals: T(m,n) is the number of partitions of the vertices of the grid graph P_m X P_n into total dominating sets.at n=52A392413
- Number of partitions of the vertices of the n X 3 grid graph into total dominating sets.at n=7A392416