Properties of the Number 73132

Seventy-Three Thousand One Hundred Thirty-Two

Basics

Value: 73131 → 73132 → 73133

Parity: even

Prime: No

Previous Prime: 73127

Next Prime: 73133

Digit Sum: 16

Digital Root: 7

Palindrome: No

Factorization: 2 ² × 47 × 389

Divisors: 1, 2, 4, 47, 94, 188, 389, 778, 1556, 18283

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 10001110110101100

Octal: 216654

Duodecimal: 363A4

Hexadecimal: 11dac

Square: 5348289424

Square Root: 270.4292883546455

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

Solution to 1 = Sum_y ∏_{k in y} a(k) for each n > 0, where the sum is over all integer partitions of n with an odd number of parts. A300862

Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 969", based on the 5-celled von Neumann neighborhood. A273849

Number of length-n binary words with no even palindrome of length > 6 and no odd palindrome of length > 3. A330131

Numbers k such that the sum of the numbers from 1 to k and that from 1 to k+1 share the same sum of divisors. A375819

a(n) = ∑_{k = 0..n-1} binomial(n,k)²*binomial(n+k-1,k). A361715

Smallest subscript j such that d=p[p(j+1)]-p[p(j)]=2n, or 0 if j does not exist (at d=4). A73132

Number of 5Xn 0..1 arrays avoiding 0 0 0 and 1 1 1 horizontally and 0 0 1 and 0 1 0 vertically. A207775