Properties of the Number 15675

Fifteen Thousand Six Hundred Seventy-Five

Basics

Value: 15674 → 15675 → 15676

Parity: odd

Prime: No

Previous Prime: 15671

Next Prime: 15679

Digit Sum: 24

Digital Root: 6

Palindrome: No

Factorization: 3 × 5 ² × 11 × 19

Divisors: 1, 3, 5, 11, 15, 19, 25, 33, 55, 57

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 11110100111011

Octal: 36473

Duodecimal: 90A3

Hexadecimal: 3d3b

Square: 245705625

Square Root: 125.19984025548915

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

4-dimensional pyramidal numbers: a(n) = (3·n+1)*binomial(n+2, 3)/4. Also Stirling2(n+2, n). A1296

Euler transform of Fibonacci numbers. A166861

Reversion of g.f. for Fibonacci numbers 1, 1, 2, 3, 5, .... A7440

a(n) = n*(n + 1)*(n² - 3·n + 5)/6. A6484

a(n) = ∑_d∣3 φ(d)*n^3/d. A54602

Triangle T(n,k) read by rows = number of partitions of n-set into k blocks with distinct sizes, k = 1..A003056(n). A131632

Excess of the number of even Motzkin n-paths (A107587) over the odd ones (A343386). A343773

Total number of edges formed after n points have been placed in general position on each edge of a triangle (as in A365929). A366932

G.f. A(x) satisfies: 2ⁿ - 1 = ∑_k=0..n [x^k]A(x)ⁿ and also satisfies: (2+z)ⁿ - (1+z)ⁿ + zⁿ = ∑_k=0..n [x^k](A(x)+z·x)ⁿ for all z, where [x^k]A(x)ⁿ denotes the coefficient of x^k in A(x)ⁿ. A100223

a(n) = n*(16·n² + 3·n - 13)/6. A172078