Properties of the Number 30813

Thirty Thousand Eight Hundred Thirteen

Basics

Value: 30812 → 30813 → 30814

Parity: odd

Prime: No

Previous Prime: 30809

Next Prime: 30817

Digit Sum: 15

Digital Root: 6

Palindrome: No

Factorization: 3 × 10271

Divisors: 1, 3, 10271, 30813

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 111100001011101

Octal: 74135

Duodecimal: 159B9

Hexadecimal: 785d

Square: 949440969

Square Root: 175.5363210278716

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

a(n) = (11·7ⁿ + 1)/6. A199489

Triangle read by rows: T(n,k) is the number of weighted lattice paths in L_n having k (1,0)-steps of weight 2 at level 0. The members of L_n are paths of weight n that start at (0,0) , end on the horizontal axis and whose steps are of the following four kinds: an (1,0)-step with weight 1, an (1,0)-step with weight 2, a (1,1)-step with weight 2, and a (1,-1)-step with weight 1. The weight of a path is the sum of the weights of its steps. A182891

Combining the conditional divide-by-two concept from Collatz sequences with Pascal's triangle, we can arrive at a new kind of triangle. Start with an initial row of just 4. To compute subsequent rows, start by appending a zero to the beginning and end of the previous row. Like Pascal's triangle, add adjacent terms of the previous row to create each of the subsequent terms. The only change is that each term is divided by two if it is even. Then take the center of this triangle. In other words, take the n-th term from the (2n)th row. A123403

Number of walks within N³ (the first octant of Z³) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 0), (-1, -1, 1), (-1, 0, -1), (1, -1, 0), (1, 1, 1)}. A149506

Number of walks within N³ (the first octant of Z³) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 0), (-1, 0, -1), (1, -1, 0), (1, 0, 0), (1, 1, 1)}. A150494

a(n) = floor(exp(16/23) * n!). A30813