14644
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 19
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 5
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 29344
- Proper Divisor Sum (Aliquot Sum)
- 14700
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- yes
Derived Values
- Euler's Totient
- 6264
- Möbius Function
- 0
- Radical
- 7322
- Omega Function (Ω)
- 4
- 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
- 133
- 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
- yes
- Odd
- no
Appears in sequences
- Octahedral numbers: a(n) = n*(2*n^2 + 1)/3.at n=28A005900
- Aliquot sequence starting at 660.at n=24A014362
- Number of 2n-bead balanced binary strings, rotationally equivalent to complement, inequivalent to reverse and reversed complement.at n=14A045659
- The PolyLog functional part of A008292 (the Eulerian numbers) is treated as a curvature to give a set of polynomial triangle sequence coefficients: p(x,n)=Sum[A008292(n,m)*x^(m-1),{m,0,n}]; q(x,n)=k from Solve[FullSimplify[ExpandAll[p[x, n]/(x - 1)^n]] - (1 + k/x^2) == 0, k].at n=46A146540
- Number of (n+1)X(n+1) 0..3 arrays with every 2X2 subblock summing to 6.at n=3A183633
- Number of (n+1) X 5 0..3 arrays with every 2 X 2 subblock summing to 6.at n=3A183637
- T(n,k)=Number of (n+1)X(k+1) 0..3 arrays with every 2X2 subblock summing to 6.at n=24A183642
- Number of nondecreasing arrangements of n+3 numbers in 0..4 with each number being the sum mod 5 of three others.at n=18A183899
- Number of -n..n arrays x(0..3) of 4 elements with zero sum and nonzero first and second differences.at n=13A200456
- Numbers k such that 2*14^k-1 is prime.at n=5A273517
- Coefficients of the polynomials generated by the e.g.f. cosh(x*z)*(x-1)/(x-exp(z*(x-1))), triangle read by rows, T(n,k) for 0 <= k <= n.at n=47A318143
- Partial sums of the even triangular numbers (A014494).at n=27A352115
- Numbers k that can be written as the sum of a perfect square and a factorial in at least 2 distinct ways.at n=28A358071