14609
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 20
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 16704
- Proper Divisor Sum (Aliquot Sum)
- 2095
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 12516
- Möbius Function
- 1
- Radical
- 14609
- 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
- Number of upward triangles in a Star of David matchstick arrangement of size n.at n=14A045950
- Terms of Binary Gleichniszahlen-Reihe (BGR) sequence A045998 converted into decimal (Look and Say Sequence, mod 2, read in binary and converted to decimal).at n=14A048522
- a(n) = prime(n)^4 - 32.at n=4A153483
- Triangle T(n, k) = prime(n)^k - 2^(2*k-3) with T(n, 1) = prime(n), read by rows.at n=13A153488
- Triangle T(n, k) = Sum_{j=0..k} (-1)^(k-j)*A159041(2*n+1, j), read by rows.at n=11A225483
- Triangle T(n, k) = Sum_{j=0..k} (-1)^(k-j)*A159041(2*n+1, j), read by rows.at n=13A225483
- Triangle T(n, k) = abs(A225483(n/2, k)) if (n mod 2 = 0), otherwise abs(A225482((n-1)/2, k) - A225483((n-1)/2, k-1)), read by rows.at n=23A225532
- Triangle T(n, k) = abs(A225483(n/2, k)) if (n mod 2 = 0), otherwise abs(A225482((n-1)/2, k) - A225483((n-1)/2, k-1)), read by rows.at n=25A225532
- a(1) = 16. For n > 1, a(n) is the position of the first occurrence of a(n-1) after the decimal point in the decimal expansion of Pi.at n=16A247345
- a(1) = 16. For n > 1, a(n) is the position of the first occurrence of a(n-1) after the decimal point in the decimal expansion of Pi.at n=36A247345
- Number of (n+2)X(5+2) 0..3 arrays with every consecutive three elements in every row and column not having exactly two distinct values, and in every diagonal and antidiagonal having exactly two distinct values, and new values 0 upwards introduced in row major order.at n=17A253022
- Numbers n such that n!3 - 3^8 is prime, where n!3 = n!!! is a triple factorial number (A007661).at n=34A261344
- Sum of the prime parts in the partitions of n into 7 parts.at n=33A309468
- Triangle read by rows: T(k,n) (k >= 0, n = 0, ..., k) = number of tilings of a k X n rectangle using 2 X 2 tiles, right trominoes and dominoes.at n=39A354010
- Number of tilings of a 3 X n rectangle using 2 X 2 tiles, right trominoes and dominoes.at n=8A354011