8495
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 26
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 10200
- Proper Divisor Sum (Aliquot Sum)
- 1705
- 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
- 6792
- Möbius Function
- 1
- Radical
- 8495
- 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
- 83
- 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
- Restricted partitions.at n=20A049285
- Expansion of (1-x)/(1-x-x^2-2*x^3+2*x^4).at n=17A052546
- Numbers k such that k and k+1 have the same sum of unitary divisors (A034448).at n=20A064125
- Number of partitions of n with positive rank.at n=35A064173
- a(n) = floor(9^n/7^n).at n=36A094991
- a(n) is the least x such that A094892(x)=n.at n=5A095391
- Expansion of (1+x^2)/(1-x-x^5) = (1+x^2)/((1-x+x^2)*(1-x^2-x^3)).at n=33A098523
- Numbers k such that 10^k - 113 is prime.at n=15A108653
- Least semiprime s for which the Mertens function M(s) = n.at n=31A123173
- Triangle read by rows: matrix inverse of A110877.at n=46A126126
- Ceiling(4*Pi*n^2).at n=25A135971
- Coefficient triangle sequence of a polynomial recursion: p(x,n)=(x + 1)*(p(x, n - 1) + 3^(n - 3)*Sum[x^i, {i, 1, n - 2}]); Row sums approximate 2*3^n.at n=57A153312
- Number of strings of numbers x(i=1..5) in 0..n with sum i^4*x(i) equal to 625*n.at n=46A184351
- Triangle of coefficients of polynomials v(n,x) jointly generated with A209701; see the Formula section.at n=52A209702
- Number of 4 X n -1,1 arrays such that the sum over i=1..4,j=1..n of i*x(i,j) is zero and rows are nondecreasing (ways to put n thrusters pointing east or west at each of 4 positions 1..n distance from the hinge of a south-pointing gate without turning the gate).at n=31A225311
- Number of n X 2 0..2 arrays with horizontal differences mod 3 never 1, vertical differences mod 3 never -1, rows lexicographically nondecreasing, and columns lexicographically nonincreasing.at n=18A229422
- Riordan array ((1-2*x)/(1-3*x+x^2), x/(1-3*x+x^2)).at n=46A238731
- Expansion of (1-2*x)/(1-3*x+x^2)^2.at n=8A238846
- Triangle T(n,k), read by rows given by (1, 1, 1, 0, 0, 0, 0, 0, 0, 0, ...) DELTA (1, 0, -1, 0, 0, 0, 0, 0, 0, 0, ...) where DELTA is the operator defined in A084938.at n=57A238941
- Number of partitions of n, where the difference between the number of odd parts and the number of even parts is 2.at n=45A240011