10944
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 18
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 42
- Divisor Sum
- 33020
- Proper Divisor Sum (Aliquot Sum)
- 22076
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 3456
- Möbius Function
- 0
- Radical
- 114
- Omega Function (Ω)
- 9
- 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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 130
- 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) = Fibonacci(n+3) - 2.at n=18A001911
- Related to partitions.at n=11A002040
- Degrees of irreducible representations of O'Nan group ON.at n=1A003919
- a(n) = (n^3 + 2*n)/3.at n=32A006527
- Number of strict (-1)st-order maximal independent sets in path graph.at n=18A007382
- Theta series of lattice Kappa_8.at n=11A015235
- G.f. f(x) = Sum_{n>=1} a(n)*x^n satisfies f(f(x)) = x*(1 + 4*x).at n=8A027436
- Concatenate n-th prime and n-th composite.at n=28A038530
- a(n) = Sum_{k=1..n} lcm(n,k).at n=31A051193
- 24-gonal numbers: a(n) = n*(11*n-10).at n=32A051876
- Successive maxima in sequence A060457.at n=46A061011
- Number of subsets of {1,2,3,...,n} that sum to 0 mod 3.at n=15A068010
- Numbers n such that sigma(n+1) = n + phi(n).at n=9A068402
- Numbers k such that gcd(d(k^3), d(k)) is not a power of 2.at n=32A069781
- Coefficient triangle of polynomials (falling powers) related to convolutions of A002605(n), n>=0, (generalized (2,2)-Fibonacci). Companion triangle is A073404.at n=10A073403
- Coefficient triangle of polynomials (rising powers) related to convolutions of A002605(n), n >= 0, (generalized (2,2)-Fibonacci). Companion triangle is A073406.at n=14A073405
- Expansion of (1-x)/(1-2*x^2-x^3).at n=23A078024
- a(n) = Fibonacci(4n+1) - 2, or Fibonacci(2n+2)*Lucas(2n-1).at n=4A081012
- Partial sums of repeated Fibonacci sequence.at n=36A094707
- Number of closed walks of length 2n at any of the nodes of degree 1 on the graph of the (7,4) Hamming code.at n=6A103334