Properties of the Number 15210

Fifteen Thousand Two Hundred Ten

Basics

Value: 15209 → 15210 → 15211

Parity: even

Prime: No

Previous Prime: 15199

Next Prime: 15217

Digit Sum: 9

Digital Root: 9

Palindrome: No

Factorization: 2 × 3 ² × 5 × 13 ²

Divisors: 1, 2, 3, 5, 6, 9, 10, 13, 15, 18

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 11101101101010

Octal: 35552

Duodecimal: 8976

Hexadecimal: 3b6a

Square: 231344100

Square Root: 123.3288287465668

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) = 10·n². A33583

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

Neither the unsorted prime signature of a(n) nor the negated unsorted prime signature of a(n) is unimodal. A332643

Number of ways to place 3 non-attacking ferses on an n X n board. A201244

Number of maximal irredundant sets in the n-cycle graph. A286954

Lesser of semi-unitary amicable numbers pair: numbers (m, n) such that susigma(m) = susigma(n) = m + n, where susigma(n) is the sum of the semi-unitary divisors of n (A322485). A322541

Number of partitions of n such that the number of blocks is congruent to 3 mod 4. A99948

Numbers m such that the GCD of the x's that satisfy σ(x) = m is 2. A241647

Dirichlet g.f.: ∏_k>=2 1 / (1 - k^-s)^binomial(k+2,3). A344203

a(n) is the square of the n-th partial sum minus the n-th partial sum of the squares, divided by a(n-1), for all n>=1, starting with a(0)=1, a(1)=2. A87955