Properties of the Number 23100

Twenty-Three Thousand One Hundred

Basics

Value: 23099 → 23100 → 23101

Parity: even

Prime: No

Previous Prime: 23099

Next Prime: 23117

Digit Sum: 6

Digital Root: 6

Palindrome: No

Factorization: 2 ² × 3 × 5 ² × 7 × 11

Divisors: 1, 2, 3, 4, 5, 6, 7, 10, 11, 12

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2730 Try Today's Challenge

Representations

Binary: 101101000111100

Octal: 55074

Duodecimal: 11450

Hexadecimal: 5a3c

Square: 533610000

Square Root: 151.98684153570665

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(1)=1, a(2)=2; thereafter, a(n) is the smallest number m not yet in the sequence such that every prime that divides a(n-1) also divides m. A60735

a(n) = n·A276086(n). A324580

Triangle read by rows: T(n, k) = [z^k] P(n, z) where P(n, z) = ∑_k=0..n binomial(n, k) * Pochhammer(n - k + c, k) * z^k / k! and c = 4. A62145

Coefficient triangle for certain polynomials N(2; n,x) (rising powers of x). A62991

Numbers m that raised to the powers from 1 to k (with k>=1) are multiple of the sum of their digits (m raised to k+1 must not be a multiple). Case k=16. A135201

Numbers with exactly 5 distinct prime divisors {2,3,5,7,11}. A147572

T(n,k)=Number of permutations of 0..floor((n·k-1)/2) on even squares of an nXk array such that each row and column of even squares is increasing. A215292

a(n) = ∑_k=1..n T(n,k), array T as in A049790. A49791

Triangle read by rows: T(n, k) = binomial(2·n, k-1)*binomial(2·n-k-1, n-k)/n for n, k >= 1, and T(n, 0) = 0ⁿ. A94385

Triangle read by rows: T(n,k) is the number of permutations of [n] with exactly k increasing runs of odd length. A97591