Properties of the Number 88803

Eighty-Eight Thousand Eight Hundred Three

Basics

Value: 88802 → 88803 → 88804

Parity: odd

Prime: No

Previous Prime: 88801

Next Prime: 88807

Digit Sum: 27

Digital Root: 9

Palindrome: No

Factorization: 3 ³ × 11 × 13 × 23

Divisors: 1, 3, 9, 11, 13, 23, 27, 33, 39, 69

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 10101101011100011

Octal: 255343

Duodecimal: 43483

Hexadecimal: 15ae3

Square: 7885972809

Square Root: 297.9983221429275

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: Hultman numbers: a(n,k) is the number of permutations of n elements whose cycle graph (as defined by Bafna and Pevzner) contains k cycles for n >= 0 and 1 <= k <= n+1. A164652

Triangle T(n,k) read by rows: coefficients (in compressed forms) in order of decreasing exponents of polynomials p_n(t) related to Hultman numbers. A185263

a(n) = number of k-tuples (u(1), u(2), ..., u(k)) with 1 <= u(1) < u(2) < ... < u(k) <= n such that u(i) - u(i-1) <= 4 for i = 2,...,k. A356620

a(n) = binomial(n+2,2)*binomial(n+6,2). A104473

Maximum number of nonempty subtrees of a binary tree with n leaves. A92781

Maximum possible number of subtrees of an n-node unrooted tree in which each node has maximum degree three (equivalently, rooted binary trees in which some internal nodes may have only one child). A subtree is a nonempty contiguous set of nodes, not necessarily including all descendants of the root. A124454

Expansion of g.f. A(x) satisfying A(x)³ = A( x·A(x)²/(1-x) ). A374565

Expansion of (1-x¹³) / (1-x)¹³. A8495

a(n) gives the number of steps taken in a process which manipulates piles of tokens arranged in a line. There are 2n (or 2n+1) tokens in all. Initially they are all in one pile. At each step every pile with more than 1 token is divided into two and half the token are added to the pile on the left and half to the pile on the right. If a pile has an odd number of tokens, the token left over stays where it is. The redistributions in each step are done in parallel. A88803