Properties of the Number 15108

Fifteen Thousand One Hundred Eight

Basics

Value: 15107 → 15108 → 15109

Parity: even

Prime: No

Previous Prime: 15107

Next Prime: 15121

Digit Sum: 15

Digital Root: 6

Palindrome: No

Factorization: 2 ² × 3 × 1259

Divisors: 1, 2, 3, 4, 6, 12, 1259, 2518, 3777, 5036

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

8509 Try Today's Challenge

Representations

Binary: 11101100000100

Octal: 35404

Duodecimal: 88B0

Hexadecimal: 3b04

Square: 228251664

Square Root: 122.91460450247563

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

Triangle read by rows: T(n, k) is the number of ways to select k disjoint point triples from an n X n X n triangular point grid, each point triple forming a 2 X 2 X 2 triangle. A289222

Number of refinement sequences n -> ... -> {1}ⁿ, where in each step one part is replaced by a partition of itself into two smaller parts (in weakly decreasing order). A327643

Number of ways to select 5 disjoint point triples from an n X n X n triangular point grid, each point triple forming a 2 X 2 X 2 triangle. A289226

Number T(n,k) of proper k-times partitions of n; triangle T(n,k), n >= 0, 0 <= k <= max(0,n-1), read by rows. A327639

T(n,k)=Number of nXk 0..1 arrays with every element equal to 2, 3, 4 or 6 king-move adjacent elements, with upper left element zero. A298070

Numbers n such that σ(n+σ(n)) = 4*σ(n). A246911

The number of regions inside a vesica piscis formed by the straight line segments mutually connecting all vertices and all points that divide the sides into n equal parts. A341877

Number of ways to write n as an ordered sum of nine powers of 2. A342252

Let S(1)={1} and, for n>1 let S(n) be the smallest set containing x+1, x+2, and 2·x for each element·in S(n-1). a(n) is the number of elements in S(n). A168043

The first Zagreb index of the Aztec diamond AZ(n) (see the Ramanes et al. reference, Theorem 2.1). A292344