8592
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 24
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 20
- Divisor Sum
- 22320
- Proper Divisor Sum (Aliquot Sum)
- 13728
- 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
- 2848
- Möbius Function
- 0
- Radical
- 1074
- 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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 26
- 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
- Minimum number of possible solutions for all irreducible stick-cutting problems.at n=15A022542
- Number of partitions of n that do not contain 6 as a part.at n=34A027340
- Multiples of 24 whose digits also sum to 24.at n=33A066270
- Coefficients of the polynomials in the numerator of the generating function f(x)=(x-x^2)/(x^3-2x^2-2x+1) for F(n)^2, (where F(n) is the Fibonacci sequence) and its successive derivatives starting with the constant.at n=29A079045
- Coefficients of the polynomials in the numerator of the generating function f(x)=(x-x^2)/(x^3-2x^2-2x+1) for F(n)^2, (where F(n) is the Fibonacci sequence) and its successive derivatives starting with the highest power of x.at n=29A079046
- Trajectory of 15 under the map k -> A003415(k) (taking the arithmetic derivative).at n=11A090636
- Trajectory of 28 under the map k -> A003415(k) (taking the arithmetic derivative).at n=8A090637
- Fourth partial sums of fourth powers (A000583).at n=5A101091
- a(n) = n*(n+1)*(n+7)*(122+57*n+n^2)/120.at n=8A101862
- a(n) = (11*5^n - 7)/4.at n=5A117088
- The n-th arithmetic derivative of 2^3.at n=10A129150
- Numbers n that raised to the powers from 1 to k (with k>=1) are multiple of the sum of their digits (n raised to k+1 must not be a multiple). Case k=6.at n=39A135191
- Minimal exponents m such that the fractional part of (4/3)^m increases monotonically (when starting with m=1).at n=7A154132
- Numbers k such that the fractional part of (4/3)^k is greater than 1-(1/k).at n=7A154133
- Number of reduced words of length n in Coxeter group on 4 generators S_i with relations (S_i)^2 = (S_i S_j)^6 = I.at n=8A163877
- Partial sums of A174928.at n=22A174929
- Number of distinct solutions of sum{i=1..2}(x(2i-1)*x(2i)) = 1 (mod n), with x() in 0..n-1.at n=43A180804
- Total sum of parts greater than 1 in all the partitions of n except one copy of the smallest part greater than 1 of every partition.at n=19A196025
- Number of 0..n arrays x(0..3) of 4 elements without any interior element greater than both neighbors.at n=10A200887
- Number of n X 2 0..3 arrays of the sum of the corresponding element, the element to the east and the element to the south in a larger (n+1) X 3 0..1 array.at n=3A229386