7273
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
- 4
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 8320
- Proper Divisor Sum (Aliquot Sum)
- 1047
- 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
- 6228
- Möbius Function
- 1
- Radical
- 7273
- 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
- 132
- 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
- Number of edge-disjoint paths between opposite corners of a 2 X n grid.at n=7A013991
- Number of edge-disjoint paths between opposite corners of 6 X n grid.at n=3A013995
- Number of squares on infinite chessboard at <= n knight's moves from a fixed square.at n=23A018836
- Numbers k such that Fib(k) == 13 (mod k).at n=36A023178
- Pair up the numbers.at n=36A030656
- Base 7 digits are, in order, the first n terms of the periodic sequence with initial period 3,0,1.at n=4A037649
- Gaps of 2 in sequence A038593 (upper terms).at n=11A038644
- Numbers ending with '3' that are the difference of two positive cubes.at n=17A038858
- Number of (unordered) ways of making change for n cents using coins of 1/2, 1, 2, 3, 5, 10, 20, 25, 50, 100 cents (all historical U.S.A. coinage denominations up to 100 cents).at n=37A067997
- Number of wide partitions of n.at n=44A070830
- Multiples of 7 using only prime digits (2, 3, 5 and 7).at n=40A077536
- Expansion of (1-x)/(1-x^2-2*x^3).at n=26A078026
- Number of elements in n-th string generated by a Kolakoski(5,1) rule starting with a(1)=1.at n=13A095342
- Number of compositions of n into 5 parts such that no two adjacent parts are equal.at n=18A106354
- a(0)=1, a(1)=1, a(n) = 9*a(n/2) for even n >= 2, and a(n) = 8*a((n-1)/2) + a((n+1)/2) for odd n >= 3.at n=21A116526
- Numerators of the limit of coefficients of q in { [x^n] W(x,q) } when read backward from [q^(n*(n-1)/2)] to [q^(n*(n-1)/2 - (n-1))], where W satisfies: W(x,q) = exp( q*x*W(q*x,q) ).at n=23A126341
- Row sums of triangle A126450: a(n) = Sum_{k=0..n} C( C(n+2,3) - C(k+2,3) + 1, n-k).at n=4A126453
- Number of simple directed graphs on n labeled nodes consisting only of some cycle graphs C_2 and nodes not part of a cycle having directed edges to both nodes in exactly one cycle.at n=8A133189
- Triangle T(n,k) = number of forests of labeled rooted trees of height at most 1, with n labels, where each root contains k labels, n>=0, 0<=k<=n.at n=38A143398
- Square array A(n,k), n>=0, k>=0, read by antidiagonals, where sequence a_k of column k is the exponential transform of C(n,k).at n=63A145460