8313
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
- 8
- Divisor Sum
- 11808
- Proper Divisor Sum (Aliquot Sum)
- 3495
- 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
- 5184
- Möbius Function
- -1
- Radical
- 8313
- Omega Function (Ω)
- 3
- 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
- 189
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- 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
- 12-gonal (or dodecagonal) pyramidal numbers: a(n) = n*(n+1)*(10*n-7)/6.at n=17A007587
- Numbers k such that s(k) + s(k+1) + ... + s(k+14) = t(k) + t(k+1) + ... + t(k+14).at n=2A033916
- Smallest x such that prime(x) mod c(x) = n, where prime(j) is the j-th prime, c(j) is the j-th composite number.at n=9A073324
- Smallest x such that Floor[A000040(x)/A002808(x)]=n.at n=8A073459
- 63-gonal numbers: a(n) = n*(61*n - 59)/2.at n=17A098140
- Lesser of a,b where n^2 = a^3 + b^3; a,b > 0 and gcd(a,b)=1. The greater of a,b is the corresponding term in A099533 and n, which is used to order this sequence, is the corresponding term in A099426.at n=27A099532
- Indices of primes in the sequence defined by A(0) = 29, A(n) = 10*A(n-1) - 21 for n > 0.at n=13A101965
- Triangle, read by rows, where T(n,k) equals the dot product of the vector of terms in row n that are to the right of T(n,k) with the vector of terms in column k that are above T(n,k): T(n,k) = Sum_{j=0..n-k-1} T(n,j+k+1)*T(j+k,k) for n > k+1 > 0, with T(n,n) = 1 and T(n,n-1) = n (n>=1).at n=48A115080
- a(0)=1. a(n) = a(n-1) + (sum of the earlier terms {among terms a(0) through a(n-1)} which are coprime to n).at n=14A127076
- Numbers k such that phi(k)=p^2, where p is product of digits of k.at n=6A153427
- Number of perfect squared squares of order n up to symmetries of the square and of its squared subrectangles, if any.at n=28A181735
- G.f.: A(x) = 1/(1 - x*B(x)), where B(x) = 1/(1 - x*C(x)^2); C(x) = 1/(1 - x*D(x)^3); D(x) = 1/(1 - x*E(x)^4); ...at n=7A197772
- Inverse Euler transform of A005169 (fountains of coins).at n=21A226999
- Number of partitions of n such that the number of even parts is a part and the number of odd parts is a part.at n=43A240575
- Numbers n such that prime(n) and phi(n) have the same decimal digits.at n=30A243462
- Number of length n 0..3 arrays with new values introduced in order from both ends.at n=10A245158
- Number of non-equivalent ways to place 3 non-attacking kings on an n X n board.at n=8A279112
- Decimal representation of the diagonal from the corner to the origin of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 966", based on the 5-celled von Neumann neighborhood.at n=35A290832
- Expansion of 1/(2 - Product_{k>=2} 1/(1 - x^k)).at n=17A307057
- On a spirally numbered square grid, with labels starting at 1, this is the number of the last cell that an (n,n+1) leaper reaches before getting trapped, or -1 if it never gets trapped.at n=14A343179