2584
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 19
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 5400
- Proper Divisor Sum (Aliquot Sum)
- 2816
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- yes
Derived Values
- Euler's Totient
- 1152
- Möbius Function
- 0
- Radical
- 646
- Omega Function (Ω)
- 5
- Little Omega Function (ω)
- 3
Special
- Factorial
- no
- Catalan Number
- no
- Bell Number
- no
- Motzkin Number
- no
- Primorial
- no
Figurate Numbers
- Fibonacci Number
- yes
- 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
- yes
- Harshad Number
- yes
- Narcissistic Number
- no
- Collatz Steps
- 102
- 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
- yes
- Odd
- no
Appears in sequences
- Fermat coefficients.at n=7A000971
- a(n) = solution to the postage stamp problem with 3 denominations and n stamps.at n=32A001208
- F(2n) = bisection of Fibonacci sequence: a(n) = 3*a(n-1) - a(n-2).at n=9A001906
- Fully multiplicative with a(prime(k)) = Fibonacci(k+2).at n=52A003965
- a(n) = floor(1000*log_2(n)).at n=5A004265
- a(n) = floor(n*phi^9), where phi is the golden ratio, A001622.at n=34A004924
- a(n) = round(n*phi^9), where phi is the golden ratio, A001622.at n=34A004944
- a(n) = 3*a(n-2) - a(n-4), a(0)=0, a(1)=1, a(2)=1, a(3)=4. Alternates Fibonacci (A000045) and Lucas (A000032) sequences for even and odd n.at n=18A005013
- Centered triangular numbers: a(n) = 3*n*(n-1)/2 + 1.at n=41A005448
- Primitive pseudoperfect numbers.at n=40A006036
- Primitive nondeficient numbers.at n=33A006039
- Sum of the first n primes.at n=37A007504
- Coordination sequence T1 for Zeolite Code ABW and ATN.at n=35A008000
- Coordination sequence T2 for Zeolite Code MEP.at n=30A008158
- Coordination sequence for sigma-CrFe, Position Xc.at n=13A009961
- a(n) = floor(binomial(n,5)/6).at n=20A011843
- Even Fibonacci numbers; or, Fibonacci(3*n).at n=6A014445
- Smallest Fibonacci number beginning with n.at n=25A020345
- Pisot sequence E(2,3).at n=15A020695
- Pisot sequences E(3,5), P(3,5).at n=14A020701