8244
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 18
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 18
- Divisor Sum
- 20930
- Proper Divisor Sum (Aliquot Sum)
- 12686
- 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
- 2736
- Möbius Function
- 0
- Radical
- 1374
- 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
- yes
- Harshad Number
- yes
- 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 Product_{m>=1} (1 + m*q^m).at n=19A022629
- Fourier coefficients of T_{10}.at n=2A035315
- Number of partitions of n such that cn(0,5) = cn(1,5) <= cn(3,5) < cn(2,5) = cn(4,5).at n=70A036867
- Triangle of increasing mobiles (circular rooted trees) with n nodes and k leaves.at n=32A055356
- Number of increasing mobiles (circular rooted trees) with n nodes and 5 leaves.at n=2A055359
- Number of primitive (aperiodic) reversible string structures with n beads using a maximum of two different colors.at n=14A056331
- Number of primitive (aperiodic) reversible string structures with n beads using exactly two different colors.at n=14A056336
- Geometric mean of the digits = 4. In other words, the product of the digits is = 4^k where k is the number of digits.at n=36A061428
- Let u(1)=u(2)=1, u(3)=2n, u(k) = abs(u(k-1)-u(k-2)-u(k-3)) and M(k) = Max_{i<=i<=k} u(i), then for any k >= A078109(n), M(k) = floor(sqrt(k + a(n))).at n=16A078108
- Consider a triangle in which the 2n-th row contains first 2n positive integers in decreasing order and the (2n+1)-st row contains first 2n+1 positive integers in increasing order; sequence contains concatenation of numbers read upward at a 45-degree angle.at n=7A079808
- Length of lists created by n substitutions k -> Range[ -Floor[Abs[k]/2],Floor[Abs[k]+3/2]] starting with {0}.at n=8A084082
- Numbers n such that every digit occurs at least once in n^3.at n=28A119735
- Number of distinct ribbon Schur functions with n boxes; also the number of distinct multisets of partitions determined by all coarsenings of compositions of n.at n=14A120421
- a(n) consecutive digits descending beginning with the digit 4 give a prime.at n=6A120829
- Triangle read by rows: T(n,k) is the number of paths of length n in the first quadrant, starting at the origin, ending at height k and consisting of 2 kind of upsteps U=(1,1) (U1 and U2), 3 kind of flatsteps F=(1,0) (F1, F2 and F3) and 1 kind of downsteps D=(1,-1).at n=23A134426
- Third column (k=2) of triangle A134832 (circular succession numbers).at n=7A134515
- Triangle of succession numbers for circular permutations.at n=47A134832
- a(n) = Sum_{d|n} d*2^(n/d)*tau(d).at n=12A174478
- Number of 4-element nondividing subsets of {1, 2, ..., n}.at n=27A187491
- Record (maximal) gaps between prime triples (p, p+4, p+6).at n=21A201596