Properties of the Number 90068

Ninety Thousand Sixty-Eight

Basics

Value: 90067 → 90068 → 90069

Parity: even

Prime: No

Previous Prime: 90067

Next Prime: 90071

Digit Sum: 23

Digital Root: 5

Palindrome: No

Factorization: 2 ² × 11 × 23 × 89

Divisors: 1, 2, 4, 11, 22, 23, 44, 46, 89, 92

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 10101111111010100

Octal: 257724

Duodecimal: 44158

Hexadecimal: 15fd4

Square: 8112244624

Square Root: 300.11331193400935

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

Least k with precisely n partitions k = x + y satisfying σ(k) = σ(x) + σ(y). A211224

a(n) = 2^n*(n-1/2). A6125

Robbins numbers: a(n) = ∏_k=0..n-1 (3k+1)!/(n+k)!; also the number of descending plane partitions whose parts do not exceed n; also the number of n X n alternating sign matrices (ASM's). A5130

Number of Baxter permutations of length n (also called Baxter numbers). A1181

Number of alternating sign 2n+1 X 2n+1 matrices symmetric about the vertical axis (VSASM's); also 2n X 2n off-diagonally symmetric alternating sign matrices (OSASM's). A5156

Busy Beaver problem: a(n) is the maximal number of steps that an n-state Turing machine can make on an initially blank tape before eventually halting. A60843

Coefficients in asymptotic expansion of probability that a random pair of elements from the alternating group A_k generates all of A_k. A113869

Robbins triangle read by rows: T(n,k) = number of alternating sign n X n matrices with a 1 at top of column k (n >= 1, 1<=k<=n). A48601

Sorting by prefix reversal (or "flipping pancakes"). You can only reverse segments that include the initial term of the current permutation; a(n) is the number of reversals that are needed to transform an arbitrary permutation of n letters to the identity permutation. A58986

Number of ordered pairs (a,b) of elements of the symmetric group S_n such that the pair a,b generates S_n. A71605