8319
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 21
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 11520
- Proper Divisor Sum (Aliquot Sum)
- 3201
- 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
- 5336
- Möbius Function
- -1
- Radical
- 8319
- 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
- 88
- 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
- 11*n^2 + 11*n + 3.at n=27A006222
- Number of partitions of n with equal number of parts congruent to each of 1, 3 and 4 (mod 5).at n=57A035580
- Smallest a(n)>a(n-1) such that a(n)^2+a(n-1)^2 is a perfect square, a(1)=6.at n=27A076672
- Smallest a(n)>a(n-1) such that a(n)^2+a(n-1)^2 is a perfect square, a(1)=7.at n=23A076673
- Smallest a(n)>a(n-1) such that a(n)^2+a(n-1)^2 is a perfect square, a(1)=10.at n=23A076675
- Smallest a(n)>a(n-1) such that a(n)^2+a(n-1)^2 is a perfect square, a(1)=11.at n=21A076676
- Triangle read by rows: T(n,k) is number of peakless Motzkin paths of length n and having k uhh...hd's starting at level 0, where u=(1,1), h=(1,0) and d=(1,-1) (can be easily expressed using RNA secondary structure terminology).at n=46A098071
- Numbers k such that (k!/k#) * 2^k + 1 is prime, where n# = primorial numbers (A034386).at n=23A108894
- a(n) = (10^k - n)(10^k + n), where k is the number of digits in n.at n=40A110397
- Number of nonempty subsets of {1, 1/2, 1/3, ..., 1/n} that sum to an integer.at n=41A111233
- Number of nonempty subsets of {1, 1/2, 1/3, ..., 1/n} that sum to an integer.at n=43A111233
- Number of nonempty subsets of {1, 1/2, 1/3, ..., 1/n} that sum to an integer.at n=42A111233
- Smallest m such that A116361(m) = n.at n=14A116362
- a(n) = smallest squarefree number not less than a(n-1)+a(n-2), a(1)=1, a(0)=0.at n=19A118728
- A sequence of asymptotic density zeta(8) - 1, where zeta is the Riemann zeta function.at n=33A143034
- Number of cubefree integers not exceeding 10^n.at n=4A160112
- a(n) = (p*(p+4)+1)/2 where (p,p+4) are the n-th cousin prime pair.at n=11A163634
- Number of partitions of n into consecutive initial Fibonacci numbers.at n=45A172491
- Partial sums of near-repdigit primes A056710.at n=20A172983
- Number of partitions of n into square parts.at n=31A179662