Properties of the Number 90088

Ninety Thousand Eighty-Eight

Basics

Value: 90087 → 90088 → 90089

Parity: even

Prime: No

Previous Prime: 90073

Next Prime: 90089

Digit Sum: 25

Digital Root: 7

Palindrome: No

Factorization: 2 ³ × 11261

Divisors: 1, 2, 4, 8, 11261, 22522, 45044, 90088

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 10101111111101000

Octal: 257750

Duodecimal: 44174

Hexadecimal: 15fe8

Square: 8115847744

Square Root: 300.1466308323317

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) is the least integer k such that A350090(k) = 2·n-1 or -1 if no such k exists. A350120

Number of nX3 0..1 arrays with every element unequal to 1, 2, 5, 6 or 8 king-move adjacent elements, with upper left element zero. A305511

Indices that give distinct values of A350090 in the order in which they appear. A350193

Pascal's triangle read by rows: C(n,k) = binomial(n,k) = n!/(k!*(n-k)!), 0 <= k <= n. A7318

Central binomial coefficients: binomial(2·n,n) = (2·n)!/(n!)². A984

Central trinomial coefficients: largest coefficient of (1 + x + x²)ⁿ. A2426

Triangle of trinomial coefficients T(n,k) (n >= 0, 0 <= k <= 2·n), read by rows: n-th row is obtained by expanding (1 + x + x²)ⁿ. A27907

Catalan triangle (with 0's) read by rows. A53121

Triangle T(n,k), 0 <= k <= n, read by rows, given by [0, 1, 1, 1, 1, 1, 1, 1, ... ] δ [1, 0, 0, 0, 0, 0, 0, 0, ... ] where δ is the operator defined in A084938. A106566

Square array of binomial coefficients T(n,k) = binomial(n,k), n >= 0, k >= 0, read by downward antidiagonals. A26729