14696
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 26
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 30240
- Proper Divisor Sum (Aliquot Sum)
- 15544
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 6640
- Möbius Function
- 0
- Radical
- 3674
- Omega Function (Ω)
- 5
- 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
- a(n) = T(2*n, n+1), T given by A027011.at n=7A027012
- T(n,n+3), T given by A027960.at n=13A027963
- Multiplicity of highest weight (or singular) vectors associated with character chi_12 of Monster module.at n=42A034400
- Partial sums of ceiling(n^2/2) (A000982).at n=44A131941
- a(1)=1, a(n)=a(n-1)+n if n even, a(n)=a(n-1)+n^2 if n is odd.at n=43A136047
- Triangle V, read by rows, where column k of V^(j+1) = column j of P^(3k+2), for j>=0, k>=0 and where P=A136220.at n=23A136230
- a(n) = (1+n)*(9 + 11*n + 4*n^2)/3.at n=21A172482
- Number of 3-step self-avoiding walks on an n X n square summed over all starting positions.at n=35A188148
- Number of -6..6 arrays x(0..n-1) of n elements with zeroth through n-1st differences all nonzero.at n=3A199941
- T(n,k)=Number of -k..k arrays x(0..n-1) of n elements with zeroth through n-1st differences all nonzero.at n=39A199943
- Number of -n..n arrays x(0..3) of 4 elements with zeroth through 3rd differences all nonzero.at n=5A199945
- Number of non-equivalent binary n X n matrices with two nonadjacent 1's.at n=21A232567
- Number of length 7+2 0..n arrays with every three consecutive terms having the sum of some two elements equal to twice the third.at n=10A248440
- Least number x such that x^n has n digits equal to k. Case k=5.at n=18A285452
- Numbers k at which point A336459(k) appears multiplicative, but A051027(k) does not.at n=24A336561
- Expansion of 1 / ((1-x)^4 - x^2)^2.at n=7A392582