8485
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 25
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 10188
- Proper Divisor Sum (Aliquot Sum)
- 1703
- 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
- 6784
- Möbius Function
- 1
- Radical
- 8485
- 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
- 109
- 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
- cos(arcsinh(x)+log(x+1)) = 1-4/2!*x^2+6/3!*x^3+5/4!*x^4-10/5!*x^5...at n=8A013074
- Numbers k such that the continued fraction for sqrt(k) has period 87.at n=4A020426
- Expansion of 1/((1-4x)(1-5x)(1-8x)(1-12x)).at n=3A028123
- Pair up the numbers.at n=42A030656
- Denominators of continued fraction convergents to sqrt(181).at n=10A041335
- Denominators of continued fraction convergents to sqrt(724).at n=10A042395
- a(n) = T(n,n+1), array T as in A047130.at n=8A047136
- Molien series for complete weight enumerators of Type II self-dual codes over Z/8Z containing the all-ones vector.at n=3A092547
- a(n)=number of Catalan knight paths in right half-plane from (0,0) to (n,2).at n=12A096611
- Numbers n such that 8*10^n + 7*R_n + 2 is prime, where R_n = 11...1 is the repunit (A002275) of length n.at n=15A103091
- Expansion of e.g.f.: exp(x + 2*x^2).at n=7A115329
- Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 1), (-1, 1, 0), (1, 0, 0), (1, 0, 1), (1, 1, -1)}.at n=7A150450
- Triangular array P*(2*I - P^2)^-1, where P is Pascal's triangle A007318 and I is the identity matrix.at n=16A162313
- T(n,k)=number of increasing sequences of n integers x(1),...,x(n) with values in 1..k*n such that x(j) divides x(k) if j divides k.at n=62A180383
- Number of increasing sequences of n integers x(1),...,x(n) with values in 1..4*n such that x(j) divides x(k) if j divides k.at n=7A180386
- Riordan matrix (1/(1-4x),(1-sqrt(1-4x))/(2*sqrt(1-4x))).at n=40A188481
- Number of partitions of n such that at least half the parts are identical.at n=36A237269
- a(n) = A289670(n)/2^f(n), where f(n) = 2*floor((n-1)/3) + ((n+2) mod 3).at n=42A289676
- a(n) = A289676(3*n+1).at n=14A290436
- Square array A(n,k), n >= 0, k >= 1, read by antidiagonals, where column k is the expansion of e.g.f. exp(Sum_{j=1..k} j*x^j).at n=43A293718