Properties of the Number 30812

Thirty Thousand Eight Hundred Twelve

Basics

Value: 30811 → 30812 → 30813

Parity: even

Prime: No

Previous Prime: 30809

Next Prime: 30817

Digit Sum: 14

Digital Root: 5

Palindrome: No

Factorization: 2 ² × 7703

Divisors: 1, 2, 4, 7703, 15406, 30812

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 111100001011100

Octal: 74134

Duodecimal: 159B8

Hexadecimal: 785c

Square: 949379344

Square Root: 175.53347259141202

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

Number of minimal complete rulers of length n. A325684

G.f.: 1/(1-x) = ∑_n>=0 a(n)*xⁿ*∏_k=1..n+1 (1-x^k). A209405

Number of n X 5 arrays of the minimum value of corresponding elements and their horizontal or diagonal neighbors in a random, but sorted with lexicographically nondecreasing rows and nonincreasing columns, 0..1 n X 5 array. A220029

Number of defective 4-colorings of an n X 3 0..3 array connected horizontally, vertically, diagonally and antidiagonally with exactly one mistake, and colors introduced in row-major 0..3 order. A229573

Number of n-step self-avoiding walks on a 2D square lattice where the walk consists of three different units and each unit cannot be adjacent to another unit of the same type. A337441

T(n,k) = number of defective 4-colorings of an n X k 0..3 array connected horizontally, vertically, diagonally and antidiagonally with exactly one mistake, and colors introduced in row-major 0..3 order. A229578

a(n) = floor(exp(17/23) * n!). A30812

Staircase path through the array P(n,k) of the k-th partial sums of cubes (A000578). A259914