8594
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 26
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 12894
- Proper Divisor Sum (Aliquot Sum)
- 4300
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 4296
- Möbius Function
- 1
- Radical
- 8594
- Omega Function (Ω)
- 2
- Little Omega Function (ω)
- 2
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
- 26
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- yes
- Squarefree Number
- yes
- 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
- Value of an urn with n balls of type -1 and n+2 balls of type +1.at n=6A003125
- Numbers k such that the continued fraction for sqrt(k) has even period and if the last term of the periodic part is deleted the central term is 92.at n=12A031590
- a(n) = floor(n^3 / Pi).at n=30A032633
- Base-4 palindromes that start with 2.at n=48A043004
- Number of primitive (aperiodic) step shifted (decimated) sequence structures using exactly four different symbols.at n=9A056408
- Poincaré series [or Poincare series] P(C_{3,2}(0); t).at n=26A124636
- 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, 0, 0), (0, 0, 1), (1, -1, 0), (1, 0, 1), (1, 1, -1)}.at n=7A150555
- Positions of zeros in A165582.at n=39A165583
- Dispersion of A016873, (5k+4), by antidiagonals.at n=30A191706
- a(n) = (11*5^n + 1)/4.at n=5A199314
- Number of (n+1) X (2+1) 0..2 arrays with the upper median of every 2 X 2 subblock differing from its horizontal and vertical neighbors by exactly one.at n=5A237631
- Number of (n+1)X(6+1) 0..2 arrays with the upper median of every 2X2 subblock differing from its horizontal and vertical neighbors by exactly one.at n=1A237635
- T(n,k) = Number of (n+1) X (k+1) 0..2 arrays with the upper median of every 2 X 2 subblock differing from its horizontal and vertical neighbors by exactly one.at n=22A237637
- T(n,k) = Number of (n+1) X (k+1) 0..2 arrays with the upper median of every 2 X 2 subblock differing from its horizontal and vertical neighbors by exactly one.at n=26A237637
- Number of (n+2) X (2+2) 0..3 arrays with every 3 X 3 subblock row and column sum not 2 3 6 or 7 and every diagonal and antidiagonal sum 2 3 6 or 7.at n=11A251888
- Number of (n+2) X (2+2) 0..3 arrays with every 3 X 3 subblock row and column sum not equal to 0 2 3 6 or 7 and every 3 X 3 diagonal and antidiagonal sum equal to 0 2 3 6 or 7.at n=11A252258
- Numbers that are representable in at least two ways as sums of four distinct nonvanishing squares.at n=37A259058
- Number of 4 X n binary arrays with rows lexicographically nondecreasing and columns lexicographically nondecreasing and row sums nondecreasing and column sums nonincreasing.at n=24A266937
- Expansion of ((sqrt(2)-1)*(-sqrt(2);x)_inf - (sqrt(2)+1)*(sqrt(2);x)_inf)/2, where (a;q)_inf is the q-Pochhammer symbol.at n=47A278296
- Expansion of 1/(1 - Sum_{j>=1} x^(Sum_{i=1..j} prime(i))).at n=42A282906