8391
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
- 4
- Divisor Sum
- 11192
- Proper Divisor Sum (Aliquot Sum)
- 2801
- 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
- 5592
- Möbius Function
- 1
- Radical
- 8391
- 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) = [ 3rd elementary symmetric function of {log(k)} ], k = 2,3,...,n.at n=15A025203
- 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 60.at n=35A031558
- Incrementally largest terms in the continued fraction for Laplace's limit constant.at n=7A033262
- Triangle T(n,k), 0 <= k <= n, read by rows, defined by: T(0,0) = 1, T(n,k) = 0 if n<k, T(n,0) = T(n-1,0) + T(n-1,1) and for k >= 1: T(n,k) = T(n-1,k-1) + x*T(n-1,k) + T(n-1,k+1) with x = 3.at n=50A110877
- a(n) = pq + pr + qr with p = prime(n), q = prime(n+1), and r = prime(n+2).at n=14A127345
- Composites in A127345.at n=5A127347
- a(n) is the smallest positive integer that, when written in binary, contains the binary representations of both the n-th prime and the n-th composite as (possibly overlapping) substrings.at n=45A175349
- 1/9 the number of (n+1) X 3 0..2 arrays with all 2 X 2 subblocks having the same four values.at n=11A184041
- Dispersion of (floor(n*e)), by antidiagonals.at n=46A191455
- Number of 3 X n 0..1 arrays with diagonals and rows unimodal and antidiagonals nondecreasing.at n=10A224159
- Minimum value unattainable as the sum of 4 attained values of a*b*c with a,b,c 0..n integers.at n=13A225266
- Number of length n+3 0..3 arrays with no four elements in a row with pattern aabb (with a!=b) and new values 0..3 introduced in 0..3 order.at n=5A242579
- T(n,k)=Number of length n+3 0..k arrays with no four elements in a row with pattern aabb (with a!=b) and new values 0..k introduced in 0..k order.at n=33A242584
- Number of meta-Sylvester classes of 5-parking functions of length n.at n=3A243683
- Number of (n+2)X(4+2) 0..3 arrays with every 3X3 subblock row and column sum equal to 0 3 5 6 or 7 and every 3X3 diagonal and antidiagonal sum not equal to 0 3 5 6 or 7.at n=4A252144
- Number of (n+2)X(5+2) 0..3 arrays with every 3X3 subblock row and column sum equal to 0 3 5 6 or 7 and every 3X3 diagonal and antidiagonal sum not equal to 0 3 5 6 or 7.at n=3A252145
- T(n,k)=Number of (n+2)X(k+2) 0..3 arrays with every 3X3 subblock row and column sum equal to 0 3 5 6 or 7 and every 3X3 diagonal and antidiagonal sum not equal to 0 3 5 6 or 7.at n=31A252148
- T(n,k)=Number of (n+2)X(k+2) 0..3 arrays with every 3X3 subblock row and column sum equal to 0 3 5 6 or 7 and every 3X3 diagonal and antidiagonal sum not equal to 0 3 5 6 or 7.at n=32A252148
- Number of n X n 0..1 arrays with each 1 horizontally or vertically adjacent to 0, 1, 3 or 4 1's.at n=3A295646
- Number of nX4 0..1 arrays with each 1 horizontally or vertically adjacent to 0, 1, 3 or 4 1s.at n=3A295648