4895
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
- 8
- Divisor Sum
- 6480
- Proper Divisor Sum (Aliquot Sum)
- 1585
- 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
- 3520
- Möbius Function
- -1
- Radical
- 4895
- 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
- 72
- 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
- Golden rectangle numbers: F(n) * F(n+1), where F(n) = A000045(n) (Fibonacci numbers).at n=10A001654
- Tetrahedral numbers written backwards.at n=32A004161
- a(n) = a(n-1) + a(n-3) + a(n-4), a(0) = a(1) = a(2) = 1, a(3) = 2.at n=19A006498
- Products of successive Fibonacci numbers.at n=32A034722
- Fibocyclotomic numbers: numbers formed from cyclotomic polynomials and Fibonacci numbers (A000045).at n=44A051258
- Numbers m such that there are precisely 3 groups of order m.at n=24A055561
- Fibonomial coefficients.at n=2A056567
- a(n) = F(n)*F(n-1) if n odd otherwise F(n)*F(n-1)-1, where F = Fibonacci numbers A000045.at n=10A059840
- Squarefree n such that the elliptic curve n*y^2 = x^3 - x arising in the "congruent number" problem has rank 3.at n=6A062693
- Cyclotomic polynomials Phi_n at x=phi divided by sqrt(5) and floored down (where phi = tau = (sqrt(5)+1)/2).at n=44A063704
- Cyclotomic polynomials Phi_n at x=phi, divided by sqrt(5) and rounded to nearest integer (where phi = tau = (sqrt(5)+1)/2).at n=44A063706
- a(n) = a(n-1) + a(n-3) + a(n-4), starting with a(0..3) = 1, 2, 2, 3.at n=18A070550
- Records in the Conway's alimentary function A070871.at n=39A070926
- a(n) = Sum_{i = 0..floor(n/2)} (-1)^(i + floor(n/2)) F(2*i + e), where F = A000045 (Fibonacci numbers) and e = (1-(-1)^n)/2.at n=20A074677
- Products of Wythoff pairs: [n*r]*[n*r^2], where [] is the floor function and r is the golden ratio, (1+sqrt(5))/2.at n=33A075312
- a(n) = Sum_{i=1..n} Ulam(i), where Ulam(i) denotes the i-th Ulam number.at n=47A078663
- Antidiagonal sums of triangle A035317.at n=18A080239
- a(n) = (Lucas(4n+1)-1)/5, or Fibonacci(2n)*Fibonacci(2n+1), or A081017(n)/5.at n=5A081018
- Product of Fibonacci and (shifted) triangular numbers.at n=11A086926
- Triangle read by rows: binary products of Fibonacci numbers.at n=49A094565