Properties of the Number 30807

Thirty Thousand Eight Hundred Seven

Basics

Value: 30806 → 30807 → 30808

Parity: odd

Prime: No

Previous Prime: 30803

Next Prime: 30809

Digit Sum: 18

Digital Root: 9

Palindrome: No

Factorization: 3 ³ × 7 × 163

Divisors: 1, 3, 7, 9, 21, 27, 63, 163, 189, 489

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 111100001010111

Octal: 74127

Duodecimal: 159B3

Hexadecimal: 7857

Square: 949071249

Square Root: 175.51922971572088

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

Triangle read by rows: T(n,k) is the number of permutations of {1,2,...,n} having k increasing even cycles (0<=k<=n). A cycle (b(1), b(2), ...) is said to be increasing if, when written with its smallest element in the first position, it satisfies b(1)<b(2)<b(3)<... . A cycle is said to be even if it has an even number of entries. For example, the permutation (18)(2347)(569) has 2 increasing even cycles. A186764

Expansion of e.g.f. 1/(1 - 3·arcsin(x)). A385347

Triangle read by rows: T(n,k) is the number of fixed-point-free involutions of {1,2,...,2n} having k descents (n>=1; 1<=k<2n-1). A161127

Numbers n such that n⁸+8 and n⁸-8 are prime. A239503

On a 3 X 3 board, the number of n-move paths for a chess king ending in a given corner square. A86346

Number of nX4 0..1 arrays with every element unequal to 2, 3 or 4 horizontally, vertically or antidiagonally adjacent elements, with upper left element zero. A317892

a(n) = floor(exp(22/23) * n!). A30807