8593
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 25
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 9268
- Proper Divisor Sum (Aliquot Sum)
- 675
- 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
- 7920
- Möbius Function
- 1
- Radical
- 8593
- 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
- no
- Odd
- yes
Appears in sequences
- Smallest k>2^n such that 2^k == 2^n (mod k).at n=12A015938
- Numbers k such that the continued fraction for sqrt(k) has period 57.at n=13A020396
- Number of partitions of n into parts 3k+1 and 3k+2 with at least one part of each type.at n=42A035620
- Becomes prime or 4 after exactly 8 iterations of f(x) = sum of prime factors of x.at n=29A048130
- Semiprimes p1*p2 such that p2 > p1 and p2 mod p1 = 11.at n=27A064909
- Generalized Mancala solitaire (A002491); to get n-th term, start with n and successively round up to next 10 multiples of n-1, n-2, ..., 1, for n>=1.at n=42A113747
- a(0)=0. a(n) = a(n-1) + sum of positive integers which are <= n and not part of the sequence.at n=38A129694
- 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, 0), (-1, 1, -1), (0, 0, -1), (1, -1, -1), (1, 1, 1)}.at n=8A149509
- a(n) is the n-th J_15-prime (Josephus_15 prime).at n=9A163795
- Coefficients of a Hermite-like polynomial from Eulerian polynomials: p(x,n) = Sum_{k=1..n+1} [Eulerian(n + 1, k - 1)*x^(k - 1)]; q(x,n) = p''(x,n) - x*p'(x,n) + n*p(x,n).at n=21A171633
- G.f. satisfies: A(x/A(x)) = 1 + sqrt(x - x/A(x)).at n=7A185753
- Number of nX5 0..4 arrays with each element x equal to the number its horizontal and vertical neighbors equal to 0,3,1,1,1 for x=0,1,2,3,4.at n=5A197620
- Number of nX6 0..4 arrays with each element x equal to the number its horizontal and vertical neighbors equal to 0,3,1,1,1 for x=0,1,2,3,4.at n=4A197621
- T(n,k)=Number of nXk 0..4 arrays with each element x equal to the number of its horizontal and vertical neighbors equal to 0,3,1,1,1 for x=0,1,2,3,4.at n=49A197623
- T(n,k)=Number of nXk 0..4 arrays with each element x equal to the number of its horizontal and vertical neighbors equal to 0,3,1,1,1 for x=0,1,2,3,4.at n=50A197623
- Number of compositions of n where the difference between largest and smallest parts equals 7 and adjacent parts are unequal.at n=14A214276
- 50k^2-40k-17 interleaved with 50k^2+10k+13 for k=>0.at n=27A217893
- Number of n X 3 arrays of the minimum value of corresponding elements and their horizontal, vertical or antidiagonal neighbors in a random, but sorted with lexicographically nondecreasing rows and columns, 0..1 n X 3 array.at n=20A219699
- Numbers n such that the decimal expansions of both n and n^2 have 3 as the digit with the smallest value and 9 as the digit with the largest value.at n=5A238553
- a(n) is the smallest k such that in the interval [1,k] of sequence A242034 all odd primes <= prime(n) are present.at n=38A242037