4180
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 13
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 24
- Divisor Sum
- 10080
- Proper Divisor Sum (Aliquot Sum)
- 5900
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 1440
- Möbius Function
- 0
- Radical
- 2090
- Omega Function (Ω)
- 5
- Little Omega Function (ω)
- 4
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
- 33
- 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
- a(n) = Fibonacci(n) - 1.at n=18A000071
- Möbius transform of A003965.at n=58A003980
- a(n) = ceiling(n*phi^11), where phi is the golden ratio, A001622.at n=21A004966
- Number of ways in which n identical balls can be distributed among 4 boxes in a row such that each pair of adjacent boxes contains at least 4 balls.at n=21A005337
- Moebius transform of Fibonacci numbers.at n=18A007436
- Coordination sequence T2 for Zeolite Code MFI.at n=41A008165
- Coordination sequence T5 for Zeolite Code MFS.at n=40A008177
- a(n) = Fibonacci(n) + (-1)^n.at n=19A008346
- "Pascal sweep" for k=9: draw a horizontal line through the 1 at C(k,0) in Pascal's triangle; rotate this line and record the sum of the numbers on it (excluding the initial 1).at n=27A009540
- Numbers k such that d(k) (number of divisors) divides phi(k) (Euler function) divides sigma(k) (sum of divisors).at n=42A020493
- Pisot sequence T(4,7).at n=14A020732
- Number of terms in 5th derivative of a function composed with itself n times.at n=14A022815
- a(n) = Fibonacci(2*n + 1) - 1.at n=9A027941
- Distinct even elements in 4-Pascal triangle A028275 (by row).at n=45A028282
- Even elements to right of central elements in 4-Pascal triangle A028275.at n=42A028286
- Inverse Stolarsky array read by antidiagonals.at n=44A035507
- a(n) = (n-3)*A006918(n-2)/2 for n >= 2, with a(0) = a(1) = 0.at n=22A038376
- Sums of 4 distinct powers of 4.at n=18A038472
- Path-counting triangular array T(i,j), read by rows, obtained from array t in A038792 by T(i,j) = t(2*i-j, j) (for i >= 1 and 1 <= j <= i).at n=53A038730
- Numbers whose base-8 representation has exactly 5 runs.at n=10A043627