Properties of the Number 15300

Fifteen Thousand Three Hundred

Basics

Value: 15299 → 15300 → 15301

Parity: even

Prime: No

Previous Prime: 15299

Next Prime: 15307

Digit Sum: 9

Digital Root: 9

Palindrome: No

Factorization: 2 ² × 3 ² × 5 ² × 17

Divisors: 1, 2, 3, 4, 5, 6, 9, 10, 12, 15

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 11101111000100

Octal: 35704

Duodecimal: 8A30

Hexadecimal: 3bc4

Square: 234090000

Square Root: 123.69316876852982

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

Exponential abundant numbers: integers k for which A126164(k) > k, or equivalently for which A051377(k) > 2k. A129575

Number of n-node connected graphs with at most one cycle. A5703

Sum of third powers of four consecutive primes. A133525

a(n) = 17·n². A244630

Number T(n,k) of length 3n words such that all letters of the k-ary alphabet occur at least once and are introduced in ascending order and which can be built by repeatedly inserting triples of identical letters into the initially empty word; triangle T(n,k), n>=0, 0<=k<=n, read by rows. A256311

a(n) = E(k)*C(n+k,k) = Euler(k)*binomial(n+k,k) for k=4. A154286

Triangular array read by rows: row n shows the coefficients of the polynomial p(x,n) constructed as in Comments; these polynomials form a strong divisibility sequence. A327320

a(n) = n³ - n*(n+1)/2. A160378

T(n,k)=Number of nXk 0..2 arrays with the row and column sums nondecreasing. A203330

Numbers k such that there exists a strict relatively prime factorization of k in which no pair of factors is relatively prime. A318720