8361
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 18
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 6
- Divisor Sum
- 12090
- Proper Divisor Sum (Aliquot Sum)
- 3729
- 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
- 5568
- Möbius Function
- 0
- Radical
- 2787
- Omega Function (Ω)
- 3
- 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
- 114
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- Squarefree Number
- no
- 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) = 2^n + n^2.at n=13A001580
- a(n) = a(n-1) + a(n-2) + 1, with a(0) = a(1) = 1.at n=18A001595
- Centered 4-dimensional orthoplex numbers (crystal ball sequence for 4-dimensional cubic lattice).at n=10A001846
- Crystal ball sequence for 10-dimensional cubic lattice.at n=4A008421
- Number of ferrites M_{10}Y_n that repeat after 6n+50 layers.at n=12A011964
- Numbers k such that the continued fraction for sqrt(k) has period 84.at n=24A020423
- Numbers whose base-4 representation contains exactly two 0's and four 2's.at n=28A045051
- a(n) = floor(A*a(n-1) + B*a(n-2) + C)/p^r, where p^r is the highest power of p dividing floor(A*a(n-1) + B*a(n-2) + C), A=1.0001, B=1.0001, C=1, p=2.at n=18A053521
- Triangle read by rows: T(n,k) = number of k-part order-consecutive partition of {1,2,...,n} (1 <= k <= n).at n=49A056242
- a(n) = 2*Fibonacci(n) - (1 - (-1)^n)/2.at n=19A062114
- a(n+2) = a(n+1) + a(n) + (-1)^n, with a(1) = a(2) = 1.at n=20A066983
- Number of nodes in virtual, "optimal", chordal graphs of diameter 4 and degree n+1.at n=18A067956
- Expansion of g.f. x*(1+x)^4/(1-x)^6.at n=9A069038
- Half the number of 9 X n binary arrays with a path of adjacent 1's and a path of adjacent 0's from top row to bottom row.at n=1A069402
- a(n) = 2*Fibonacci(2*n+1) - 1.at n=9A069403
- Numbers n whose sum of divisors and number of divisors are both triangular numbers.at n=27A070996
- Leyland numbers: 3, together with numbers expressible as n^k + k^n nontrivially, i.e., n,k > 1 (to avoid n = (n-1)^1 + 1^(n-1)).at n=22A076980
- Duplicate of A069403.at n=9A085327
- Convolution of sigma(n) with phi(n).at n=36A086733
- Numbers n such that nextprime(n^3)-prevprime(n^3) = 4.at n=40A090121