Properties of the Number 15456

Fifteen Thousand Four Hundred Fifty-Six

Basics

Value: 15455 → 15456 → 15457

Parity: even

Prime: No

Previous Prime: 15451

Next Prime: 15461

Digit Sum: 21

Digital Root: 3

Palindrome: No

Factorization: 2 ⁵ × 3 × 7 × 23

Divisors: 1, 2, 3, 4, 6, 7, 8, 12, 14, 16

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 11110001100000

Octal: 36140

Duodecimal: 8B40

Hexadecimal: 3c60

Square: 238887936

Square Root: 124.32216214336043

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

Number of sum-free subsets of {1, ..., n}. A7865

a(n) = 7·a(n-1) - a(n-2) with a(0) = 0, a(1) = 1. A4187

Rectangular array of numbers Fibonacci(m(n+1))/Fibonacci(m), m >= 1, n >= 0, read by downward antidiagonals. A28412

Number T(n,k) of set partitions of [n] with minimal block length multiplicity equal to k; triangle T(n,k), n>=0, 0<=k<=n, read by rows. A271424

Numbers k such that σ (x) = k has exactly 11 solutions. A60678

Array T(m,n) = Fibonacci(m·n)/Fibonacci(m), by antidiagonals; transpose of A028412. A214978

Triangle T(n, k, m) = t(n, m)/(t(k, m)*t(n-k, m)), where t(n, k) = ∏_j=1..n p(j, k+1), p(n, x) = ∑_j=0..n (-1)^j*A053122(n, j)*x^j, and m = 8, read by rows. A156602

Numerator of x(n) = x(n-1) + x(n-2), x(0)=0, x(1)=1/3; denominator=A167817. A167816

Permutation trees of power n and height k. A179454

a(n) = A108994(n)*2/(n+2) for n>=0. A108995