Properties of the Number 7273

Seven Thousand Two Hundred Seventy-Three

Basics

Value: 7272 → 7273 → 7274

Parity: odd

Prime: No

Previous Prime: 7253

Next Prime: 7283

Digit Sum: 19

Digital Root: 1

Palindrome: No

Factorization: 7 × 1039

Divisors: 1, 7, 1039, 7273

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1110001101001

Octal: 16151

Duodecimal: 4261

Hexadecimal: 1c69

Square: 52896529

Square Root: 85.28188553262645

Classification

Fibonacci: No

Bell Number: No

Factorial Number: No

Regular Number: No

Perfect Number: No

Special

Kaprekar Constant: No

Munchausen Constant: No

Armstrong Number: No

Kaprekar Number: No

Catalan Number: No

Vampire Number: No

Taxicab Number: No

Super Prime: No

Friedman Number: No

Fermat Number: No

Cullen Number: No

OEIS Sequences

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). A145460

Number of compositions of n with all adjacent parts (x, y) satisfying x > 2y or y = 2x. A342336

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. A143398

Number of "ON" cells after n-th stage in simple 2-dimensional cellular automaton (see Comments for precise definition). A160117

Number of integer partitions of n where the parts have lesser mean than the distinct parts. A360251

Number of squares on infinite chessboard at <= n knight's moves from a fixed square. A18836

Numbers k that are the products of two distinct primes such that 2·k-1, 4·k-3, 8·k-7 and 16·k-15 are also products of two distinct primes. A177213

Square array A(n,k), n >= 0, k >= 0, read by antidiagonals, where column k is the expansion of ∏_j>=1 1/(1 - j^k*x^j). A292193

Square array A(n,k), n>=0, k>=0, read by antidiagonals, where A(0,k) = 1 and A(n,k) = (-1)^k+1 * ∑_i=0..n-1 (-1)ⁱ * binomial(n-1,i) * binomial(i+1,k) * A(n-1-i,k) for n > 0. A292948

T(n,k)=Number of nXk 0..1 arrays with every element unequal to 1, 2, 4, 6 or 7 king-move adjacent elements, with upper left element zero. A305097