10948
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 22
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 24
- Divisor Sum
- 24192
- Proper Divisor Sum (Aliquot Sum)
- 13244
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 4224
- Möbius Function
- 0
- Radical
- 5474
- Omega Function (Ω)
- 5
- Little Omega Function (ω)
- 4
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
- 42
- 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
- Coefficients of Chebyshev polynomials.at n=13A005583
- a(n) = floor(n*(n-1)*(n-2)/30).at n=70A011912
- Pisot sequence L(4,5).at n=18A018910
- Pisot sequence L(7,10).at n=16A020743
- Even numbers to the left of the central elements of the (1,2)-Pascal triangle A029635.at n=42A029647
- Even numbers to the right of the central numbers of the (2,1)-Pascal triangle A029653.at n=42A029661
- Denominators of continued fraction convergents to sqrt(780).at n=7A042505
- Pisot sequence L(5,7).at n=17A048584
- Row sums of A051599.at n=11A053210
- a(n) = Fibonacci(4n+1) + 2, or Fibonacci(2n-1)*Lucas(2n+2).at n=5A081010
- a(n) = A004061(n) - 1.at n=11A086123
- Radius of inscribed circle within primitive Pythagorean triangles having legs that add up to a square, sorted on hypotenuse.at n=34A089551
- Delete first column (index 0) and all rows having nonprime index of triangle T(p,k) defined in A034807 (coefficients of Lucas polynomials). Sequence gives resulting sub-triangle read by rows.at n=39A096539
- Expansion of (1 - x - 4*x^2)/(1 - x - 8*x^2).at n=9A100303
- Number of increasing rooted trees with n generators.at n=5A108522
- Smallest nonsquarefree integer > the n-th term of the Fibonacci sequence.at n=20A114555
- Integers n > 1 such that A130280(4n^2) < n, i.e., there is an m < n, m > 1 such that 4n^2(m^2 - 1) + 1 is a square.at n=15A130281
- a(n) = Fibonacci(n) + 2.at n=21A157725
- a(n) = n*(n+1)*(5*n + 4)/6.at n=23A162147
- a(n) = n*(14*n - 1).at n=28A195024