14279
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 23
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 14520
- Proper Divisor Sum (Aliquot Sum)
- 241
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 14040
- Möbius Function
- 1
- Radical
- 14279
- 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
- 102
- 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
- Expansion of 1/(1 - 11*x + x^2).at n=4A004190
- Denominators of continued fraction convergents to sqrt(117).at n=9A041213
- Denominators of continued fraction convergents to sqrt(468).at n=13A041893
- Numbers k such that sopfr(k) = sopfr(k - sopfr(k)).at n=20A050781
- Consider all integer triples (i,j,k), j,k>0, with i^3=j^3+binomial(k+2,3), ordered by increasing i; sequence gives i values.at n=20A054234
- Consider all integer triples (i,j,k), j,k>0, with i^3=j^3+binomial(k+2,3), ordered by increasing i; sequence gives j values.at n=39A054235
- a(n) = n^4 - 3*n^2 + 1.at n=11A057722
- Nonprime numbers k such that (k+1)*Sum_{d|k} 1/(d+1) is an integer.at n=14A069155
- Duplicate of A069155.at n=14A074977
- a(n) = prime(n)*prime(n+3).at n=28A090090
- Lengths of the B blocks in analysis of A090822.at n=12A091411
- a(n) = A007290(n+2) - 1 = 2*C(n+2,3) - 1.at n=34A108766
- Numbers k such that 2*k+1, 3*k+2, 4*k+3 and 5*k+4 are primes.at n=17A138700
- a(1)=1, a(2)=2, a(3)=3, a(4)=4, a(5)=5, a(n+1)=a(1)*a(2)*...*a(n)-1 for n>=5.at n=6A140432
- Triangle T(n, k) = binomial(n, k)^2 - binomial(n, k) - 1, read by rows.at n=58A144403
- Triangle T(n, k) = binomial(n, k)^2 - binomial(n, k) - 1, read by rows.at n=62A144403
- Mix A091411 and its differences.at n=24A157217
- A product triangle sequence based on recursion:a=5; f(n,a)=(2*a+1)*f(n-1,a)+f(n-2,a).at n=16A173006
- A product triangle sequence based on recursion:a=5; f(n,a)=(2*a+1)*f(n-1,a)+f(n-2,a).at n=19A173006
- a(n) = (n^3 - 3n^2 + 14n - 6)/6.at n=44A180415