8357
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 23
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 8556
- Proper Divisor Sum (Aliquot Sum)
- 199
- 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
- 8160
- Möbius Function
- 1
- Radical
- 8357
- 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
- Sum of 12 nonzero 8th powers.at n=20A003390
- Sum{T(n-k,k)}, 0<=k<=[ n/2 ], T given by A026648.at n=18A026658
- Least k such that 1+2+...+k >= E{1,2,...,n}, where E is the 4th elementary symmetric function.at n=15A027918
- Number of points in N^4 of norm <= n.at n=12A055403
- Records in A065925.at n=16A065927
- Composite numbers k such that the continued fraction for k/m contains no 2 for any 1 <= m <= k.at n=33A082409
- Numbers n such that the partition function A000041(k) is even and odd the same number of times for 0 <= k <= n.at n=40A098936
- Column 1 and row sums of triangle A130580.at n=12A130581
- Number of sets (in the Hausdorff metric geometry) at each location between two sets defining a polygonal configuration consisting of two 4-gonal polygonal components chained with string components of length l as l varies.at n=9A152929
- a(n) = 36*n^2 - 55*n + 21.at n=15A157262
- a(1)= 1; a(2)= 5; thereafter a(n)= a(n-1) + a(n-2) + 5.at n=15A166863
- Number of white square subarrays of (n+1)X(5+1) binary arrays with no element equal to a strict majority of its diagonal and antidiagonal neighbors, with upper left element zero.at n=6A230986
- Number of white square subarrays of (n+1)X(7+1) binary arrays with no element equal to a strict majority of its diagonal and antidiagonal neighbors, with upper left element zero.at n=4A230988
- T(n,k)=Number of white square subarrays of (n+1)X(k+1) binary arrays with no element equal to a strict majority of its diagonal and antidiagonal neighbors, with upper left element zero.at n=59A230989
- T(n,k)=Number of white square subarrays of (n+1)X(k+1) binary arrays with no element equal to a strict majority of its diagonal and antidiagonal neighbors, with upper left element zero.at n=61A230989
- T(n,k)=Number of black square subarrays of (n+1)X(k+1) binary arrays with no element equal to a strict majority of its diagonal and antidiagonal neighbors, with upper left element zero.at n=59A231070
- T(n,k)=Number of black square subarrays of (n+1)X(k+1) binary arrays with no element equal to a strict majority of its diagonal and antidiagonal neighbors, with upper left element zero.at n=61A231070
- a(n) = Sum_{i=0..n} digsum_3(i)^4, where digsum_3(i) = A053735(i).at n=42A231505
- Composites c for which an integer 1 < k < c exists such that (c-k)! == -1 (mod c).at n=25A256519
- Number of (n+2)X(3+2) 0..1 arrays with each row and column divisible by 7, read as a binary number with top and left being the most significant bits.at n=6A262315