14088
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 21
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 35280
- Proper Divisor Sum (Aliquot Sum)
- 21192
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 4688
- Möbius Function
- 0
- Radical
- 3522
- 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
- 107
- 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
- Multiplicity of highest weight (or singular) vectors associated with character chi_13 of Monster module.at n=42A034401
- Consider triangle in which n-th row contains the smallest set of n consecutive numbers whose LCM is divisible by primorial(n) (the product of first n primes). Sequence contains the first column.at n=17A083130
- a(n) = Sum_{k=0..n} binomial(n, floor(k/2))*2^(n-k).at n=10A127358
- Number of strings of numbers x(i=1..n) in 0..3 with sum i*x(i)^2 equal to n*9.at n=11A184435
- Smallest sets of 6 consecutive abundant numbers in arithmetic progression. The initial abundant number is listed.at n=33A228963
- Numbers x such that the base 10 representation of x^2 forms an arithmetic sequence when split into equal-sized chunks.at n=2A244660
- Terms of A143407, sorted.at n=31A270564
- Number of 6-cycles in the n X n knight graph.at n=13A289181
- a(n) = Sum_{k=0..n} r_4(k^2 + 1), where r_4(k) is the number of ways of writing k as a sum of 4 squares (A000118).at n=15A333174
- Numbers m such that the proportion of nonsquarefree numbers in the interval [1, m] is greater than the corresponding proportion for all k > m.at n=33A336026
- One-quarter of the number of regions in the central square of an equal-armed cross with arms of length n (as in A331456).at n=10A337641
- G.f. A(x) satisfies: A(x) = x + x^2 * exp(2 * Sum_{k>=1} (-1)^(k+1) * A(x^k) / k).at n=12A345243
- a(n) = Sum_{k=1..n} (-1)^(k+1) * floor((n/k)^3).at n=24A350222
- G.f. A(x) satisfies: 1 = Sum_{n=-oo..oo} (-x)^(n*(n+1)/2) * A(x)^(n*(n-1)/2), with A(0) = 0.at n=18A354661