Properties of the Number 10900

Ten Thousand Nine Hundred

Basics

Value: 10899 → 10900 → 10901

Parity: even

Prime: No

Previous Prime: 10891

Next Prime: 10903

Digit Sum: 10

Digital Root: 1

Palindrome: No

Factorization: 2 ² × 5 ² × 109

Divisors: 1, 2, 4, 5, 10, 20, 25, 50, 100, 109

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: 10101010010100

Octal: 25224

Duodecimal: 6384

Hexadecimal: 2a94

Square: 118810000

Square Root: 104.4030650891055

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

T(n,k)=Number of n X k nonnegative integer arrays with new values 0 upwards introduced in row major order and no element equal to any horizontal or vertical neighbor (colorings ignoring permutations of colors). A207868

Numbers in which 0 outnumbers all other digits together. A292730

a(n) = 6ⁿ+5ⁿ-1. A155633

T(n,k) = Number of horizontal and antidiagonal neighbor colorings of the odd squares of an n X k array with new integer colors introduced in row major order. A216084

T(n,k)=Number of n X k nonnegative integer arrays with new values 0 upwards introduced in row major order and no element equal to any horizontal, diagonal or antidiagonal neighbor (colorings ignoring permutations of colors). A208096

Triangle read by rows: T(n,k) is the number of chiral pairs of cycles of length n (1) with a color pattern of exactly k colors or equivalently (2) partitioned into k nonempty subsets. A320647

Square array A(n,k) = (2·n)! [xⁿ] BesselI(0, 2·sqrt(x))^k read by antidiagonals. A287318

Central terms of pendular triangle A118345. A118346

Rectangular table, read by antidiagonals, where the g.f.s of row n, R(x,n), satisfy: R(x,n+1) = R(G(x),n) for n>=0 and x·R(x,0) = G(x) = x + x·G(G(x)) is the g.f. of A030266. A128325

Number of 5-dimensional cubic lattice walks that start and end at origin after 2n steps, free to pass through origin at intermediate stages. A287317