4173
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 15
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 6048
- Proper Divisor Sum (Aliquot Sum)
- 1875
- 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
- 2544
- Möbius Function
- -1
- Radical
- 4173
- 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
- 126
- Smith Number
- yes
- 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
- a(n) = n*(n^2 + 12*n - 25)/6.at n=26A026057
- Decimal part of a(n)^(1/7) starts with n so that a(n) < a(n+1).at n=29A034072
- Number of partitions satisfying cn(1,5) + cn(4,5) < cn(2,5) + cn(3,5).at n=33A039892
- Numbers whose base-7 representation contains exactly four 1's.at n=23A043400
- Numbers having three 1's in base 8.at n=34A043427
- Numbers whose base-4 representation contains exactly three 0's and three 1's.at n=19A045031
- Numbers n such that 55*2^n-1 is prime.at n=27A050553
- Number of trees with n nodes and 4 leaves.at n=27A055291
- a(1) = 1; a(n+1) = sum of terms in continued fraction for the sum of the continued fractions, [a(1); a(2), a(3), ..., a(n)] and [0; a(1), a(2), a(3), ..., a(n)].at n=32A058082
- Least number beginning with prime(n) such that every concatenation is a prime.at n=12A090508
- a(n) is the area of the triangle with sides prime(n), prime(n+2) and prime(n+4), rounded down to the nearest integer.at n=20A096384
- Define a(1)=1. Thereafter a(n) is the smallest positive integer with the property that a(n)^2 cannot be created by summing the squares of at most n values chosen among the previous terms (with repeats allowed).at n=16A111302
- n+sigma(n)+sigma(sigma(n)) is a triangular number.at n=24A116015
- Triangle read by rows in which the binomial transform of the n-th row gives the Euler transform of the n-th diagonal of Pascal's triangle (A007318).at n=58A116672
- Triangle read by rows: T(n,k) is the number of deco polyominoes of height n and such that the sum of the bottom levels of all columns is k (n>=1, k>=0; informally, the number of the "missing" cells in the right bottom corner of the polyomino). A deco polyomino is a directed column-convex polyomino in which the height, measured along the diagonal, is attained only in the last column.at n=33A122104
- Number of integer-sided triangles with all sides <= n and sides relatively prime.at n=37A123324
- Triangle read by rows: row n is the first row of the matrix M[n]^(n-1), where M[n] is the n X n tridiagonal matrix with main diagonal (1,4,4,...) and super- and subdiagonals (1,1,1,...).at n=51A124576
- A106486-encodings of combinatorial games equivalent to game {1|1}.at n=37A125998
- a(n) = 107*n.at n=39A134297
- L.g.f.: A(x) = log( 1 + Sum_{n>=1} (n-1)!*x^n ) = Sum_{n>=1} a(n)*x^n/n.at n=6A141154