8365
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 22
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 11520
- Proper Divisor Sum (Aliquot Sum)
- 3155
- 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
- 5712
- Möbius Function
- -1
- Radical
- 8365
- 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
- 39
- 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
- Generalized Stirling numbers, [n+2,n]_2.at n=14A001701
- Pseudoprimes to base 6.at n=23A005937
- a(n) = (n+1)*(n^2 +8*n +6)/6. Number of n-dimensional partitions of 4. Number of terms in 4th derivative of a function composed with itself n times.at n=34A008778
- Pseudoprimes to base 22.at n=40A020150
- Pseudoprimes to base 51.at n=29A020179
- Pseudoprimes to base 52.at n=28A020180
- Pseudoprimes to base 71.at n=38A020199
- Strong pseudoprimes to base 36.at n=15A020262
- Strong pseudoprimes to base 51.at n=8A020277
- Strong pseudoprimes to base 71.at n=9A020297
- Numbers k such that the continued fraction for sqrt(k) has period 74.at n=21A020413
- a(n) = [ (3rd elementary symmetric function of S(n))/(first elementary symmetric function of S(n)) ], where S(n) = {first n+2 odd positive integers}.at n=13A024202
- 16-gonal (or hexadecagonal) numbers: a(n) = n*(7*n-6).at n=35A051868
- a(n) = A053141(n)/2.at n=6A053142
- Numbers k such that sigma(k+1) - sigma(k) = sigma(k)/d(k), where d(k) denotes the number of divisors of k.at n=5A066176
- a(n) = (1/12)*(n+1)*(n^3+19*n^2+118*n+228).at n=14A092327
- Output of the linear congruential pseudo-random number generator rand() used in Microsoft's Visual C++.at n=7A096558
- Perimeter of integer triangle (A001611(n), A001611(n+1), A001611(n+2)).at n=17A097280
- Write 1/sqrt(2) as a binary fraction; read this from left to right and whenever a 1 appears, note the integer formed by reading leftwards from that 1.at n=5A099972
- Numerator of the polynomial A_l(x) = sum_{d=1..l-1} x^(l-d)/d for index l=2n+1 evaluated at x=5.at n=1A145617