8240
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 14
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 20
- Divisor Sum
- 19344
- Proper Divisor Sum (Aliquot Sum)
- 11104
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 3264
- Möbius Function
- 0
- Radical
- 1030
- Omega Function (Ω)
- 6
- 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
- 127
- 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
- Expansion of 1/((1-8*x)*(1-9*x)*(1-11*x)).at n=3A020977
- a(n) = dot_product(1,2,...,n)*(4,5,...,n,1,2,3).at n=26A026040
- Number of ways to partition n labeled elements into pie slices of odd sizes forming an aperiodic pattern.at n=7A032326
- Numerators of continued fraction convergents to sqrt(258).at n=2A041482
- Number of n X n matrices over GF(4) under row and column permutations.at n=3A052271
- Number of 3 X 3 matrices with entries mod n, up to row and column permutation.at n=3A058001
- Numbers k such that sopf(k) + 1 = sopf(k+1), where sopf(k) = A008472(k).at n=18A064111
- a(n) = floor(e^n mod n^e).at n=39A066433
- a(n) = Sum_{r|n, s|n, t|n, r<s<t} r*s*t.at n=27A067817
- Smallest multiple of n-th prime which is == 1 mod (n+1)-st prime.at n=26A073603
- Convolution of A075298 with A056594.at n=27A075495
- Numbers k such that the k-th Catalan number C(2k, k)/(k + 1) is divisible by k/2 but not divisible by k.at n=42A120622
- Number of 2-anisohedral polyiamonds of order n.at n=21A121308
- Triangle T(n,k), 0 <= k <= n, read by rows defined by: T(0,0)=1, T(n,k)=0 if k < 0 or if k > n, T(n,0) = 4*T(n-1,0) + T(n-1,1), T(n,k) = T(n-1,k-1) + 5*T(n-1,k) + T(n-1,k+1) for k >= 1.at n=23A126331
- Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, -1), (-1, 0, 1), (1, -1, 1), (1, 1, 0)}.at n=9A148699
- Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 1), (-1, 0, 0), (-1, 1, -1), (1, 0, 0), (1, 1, 1)}.at n=7A150695
- a(n) = 250*n - 10.at n=32A154378
- Expansion of (1-5x)/(1-8x+4x^2).at n=5A154627
- Partial sums of A160120.at n=32A162778
- E.g.f. satisfies: A(A(x))^2 = A(x)^2 * A'(x).at n=4A179497