Properties of the Number 15072

Fifteen Thousand Seventy-Two

Basics

Value: 15071 → 15072 → 15073

Parity: even

Prime: No

Previous Prime: 15061

Next Prime: 15073

Digit Sum: 15

Digital Root: 6

Palindrome: No

Factorization: 2 ⁵ × 3 × 157

Divisors: 1, 2, 3, 4, 6, 8, 12, 16, 24, 32

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 11101011100000

Octal: 35340

Duodecimal: 8880

Hexadecimal: 3ae0

Square: 227165184

Square Root: 122.76807402578245

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 collinear point-triples in an n X n grid. A938

Consider the base-7 Kaprekar map n->K(n) defined in A165071. Sequence gives numbers belonging to cycles, including fixed points. A165076

Consider the base-7 Kaprekar map n->K(n) defined in A165071. Sequence gives numbers belonging to cycles of length greater than 1. A165078

a(n) = Lucas(n+4) - (3·n+7). A23537

Number of partitions of n such that 2*(greatest part) <= (number of parts). A237752

Number of different cuboids with volume (pq)ⁿ, where p,q are distinct prime numbers. A101427

"DHK[ 8 ]" (bracelet, identity, unlabeled, 8 parts) transform of 1,1,1,1,... A32249

For any circular arrangement of 0..n-1, let S = sum of squares of every sum of two contiguous numbers; then a(n) = # of distinct values of S. A7773

Number of non-intersecting polygons that it is possible for an accelerating ant to produce with n steps (rotations & reflections not included). On step 1 the ant moves forward 1 unit, then turns left or right and proceeds 2 units, then turns left or right until at the end of its n-th step it arrives back at its starting place. A101856

Numbers n such that 3 and 5 do not divide swing(n) = A056040(n). A196748