14054
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 14
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 21084
- Proper Divisor Sum (Aliquot Sum)
- 7030
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 7026
- Möbius Function
- 1
- Radical
- 14054
- 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
- 58
- 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
- yes
- Odd
- no
Appears in sequences
- Numbers whose base-7 representation contains exactly four 5's.at n=27A043416
- Number of compositions of n where the largest part is less than the number of parts.at n=14A098125
- Triangle read by rows giving the coefficients of general sum formulas of n-th Fibonacci numbers (A000045). The k-th row (k>=1) contains T(i,k) for i=1 to 2*k-1, where T(i,k) satisfies F(n) = Sum_{k=1..n} Sum_{i=1..2*k-1} T(i,k) * C(n-k,i-1) * n^(n-k) / (n-1)!.at n=17A100492
- Number of n X n binary arrays symmetric about both diagonal and antidiagonal with all ones connected only in a 01010-11111-00100 pattern in any orientation.at n=18A147350
- Partial sums of A079062.at n=32A177455
- Iterates of f(x)=floor((3x-1)/2) from x=6.at n=20A183208
- Numbers k such that 3^k + 20 is prime.at n=33A219040
- a(n) = (a(n-1) + a(n-3))/2^m, where 2^m is the highest power of 2 that divides both a(n-1) and a(n-3), with a(0) = a(1) = a(2) = 1.at n=47A341313
- Squarefree semiprimes (products of two distinct primes) between sphenic numbers (products of three distinct primes).at n=42A362507
- Semiprimes that are the sum of two successive semiprimes and also the sum of three successive semiprimes.at n=38A370162
- Numbers whose binary expansion consists of alternating runs of 1's and 0's where each run of 0's is exactly one shorter than the preceding run of 1's, and the expansion ends with a 0-run.at n=28A387270
- a(n) = (n^4-3*n^2+4*n+2)/2.at n=13A387525