8399
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 29
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 8664
- Proper Divisor Sum (Aliquot Sum)
- 265
- 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
- 8136
- Möbius Function
- 1
- Radical
- 8399
- 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
- 65
- 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
- a(n) = n^3 + n^2 - 1.at n=19A003777
- a(n) = (n + 3)*(n^2 + 6*n + 2)/6.at n=34A005286
- Number of partitions of n into an even number of parts, the least being 3; also, a(n+3) = number of partitions of n into an odd number of parts, each >=3.at n=57A027195
- Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 11 ones.at n=19A031779
- Concatenation of n-th prime number and n-th lucky number.at n=22A032603
- Number of partitions of n into parts not of the form 7k, 7k+3 or 7k-3. Also number of partitions such that the differences between parts at distance 2 are greater than 1.at n=49A035939
- Numbers whose base-4 representation contains exactly three 0's and three 3's.at n=31A045079
- Number of digits in n-th term of A001387.at n=22A049194
- Digitally balanced numbers in both bases 2 and 3.at n=6A049361
- Composite numbers k such that sigma(2*k+1)-sigma(k) = k+1.at n=2A068368
- Prime(n)*prime(2*n)+prime(n)+prime(2*n).at n=16A072672
- Composite numbers k such that the continued fraction for k/m contains no 2 for any 1 <= m <= k.at n=34A082409
- Indices of primes in sequence defined by A(0) = 67, A(n) = 10*A(n-1) - 13 for n > 0.at n=9A101533
- Least j > 1 for n > 0 such that j^2 = (n^2 + 1)*(k^2) + (n^2 + 1)*k + 1 where k sequence = A106230.at n=20A106229
- Positive integers i for which A112049(i) == 7.at n=19A112067
- Square array A(x,y) = y-th odd number 2i+1 (i>=1) for which A112049(2i+1)=x, or 0 if no such i exists; read by descending antidiagonals.at n=52A112070
- Transpose of A112070.at n=47A112071
- Odd numbers n for which 19 is the smallest i (>= 1) with Jacobi symbol J(i,n) getting either a value 0 or -1.at n=2A112078
- a(n) = least k such that the remainder when 7^k is divided by k is n.at n=11A119715
- Riordan array (1/(1-x), c(x)-1) where c(x) is the g.f. of A000108.at n=48A122897