8124
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 15
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 18984
- Proper Divisor Sum (Aliquot Sum)
- 10860
- 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
- 2704
- Möbius Function
- 0
- Radical
- 4062
- Omega Function (Ω)
- 4
- 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
- 65
- 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_91 of Monster module.at n=43A034479
- Triangle of coefficients of generating function of 4-ary rooted trees of height at most n.at n=51A036606
- Number of 4-ary rooted trees with n nodes and height at most 4.at n=20A036609
- a(n) = sum of n-th column in array in A100452.at n=20A100454
- Sum of the sides of ordered 2 X 2 prime squares.at n=42A105088
- Numbers n such that p(2n) is prime, where p(n) is the number of partitions of n.at n=47A114165
- Number of partitions of n into parts not congruent to 0, 2, 12, 14, 16, 18, 20, 30 (mod 32).at n=40A115671
- Numbers n such that every digit occurs at least once in n^3.at n=27A119735
- Numbers n such that n is divisible by (3*s(n)*s(n)+2), where s(n) = sum of digits of n.at n=31A134556
- 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, -1, 0), (-1, 1, -1), (0, 0, 1), (1, 0, 0)}.at n=9A149813
- a(n) = 625*n - 1.at n=12A158374
- Number of lines through at least 2 points of a 9 X n grid of points.at n=21A160849
- Number of binary strings of length n with equal numbers of 00001 and 10001 substrings.at n=14A164204
- a(n) = 3*n*(310*n^2 + 63*n - 12).at n=1A165809
- a(n) = a(n-1) + A073053(a(n-1)).at n=36A173578
- Number of even entries in the top rows of all 2-compositions of n. A 2-composition of n is a nonnegative matrix with two rows, such that each column has at least one nonzero entry and whose entries sum up to n.at n=7A181337
- Partitions of 2*n into parts not congruent to 0, +-2, +-12, +-14, 16 (mod 32).at n=20A185083
- Total sum of the smallest part of every partition of every shell of n.at n=23A196039
- Partitions of 2*n + 1 into parts not congruent to 0, +-4, +-6, +-10, 16 (mod 32).at n=19A208851
- Partitions of n into parts not congruent to 0, +-4, +-6, +-10, 16 (mod 32).at n=39A208856