Properties of the Number 15075

Fifteen Thousand Seventy-Five

Basics

Value: 15074 → 15075 → 15076

Parity: odd

Prime: No

Previous Prime: 15073

Next Prime: 15077

Digit Sum: 18

Digital Root: 9

Palindrome: No

Factorization: 3 ² × 5 ² × 67

Divisors: 1, 3, 5, 9, 15, 25, 45, 67, 75, 201

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 11101011100011

Octal: 35343

Duodecimal: 8883

Hexadecimal: 3ae3

Square: 227255625

Square Root: 122.78029157808675

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 ordered pairs of integer partitions of n where no part of the first is greater than any part of the second. A322439

T(n,k) = number of defective 4-colorings of an n X k 0..3 array connected horizontally, vertically, diagonally and antidiagonally with exactly two mistakes, and colors introduced in row-major 0..3 order. A229755

A convolution triangle of numbers obtained from A025748. A48966

Triangle, read by rows, equal to P⁶, where triangle P = A135880; also equals Q³ where Q = P² = A135885. A135893

Sum of tetrahedral numbers A000292(k), with k in the reduced residue system modulo n. A189918

Numbers n such that n² + 1 is the product of three distinct Fibonacci numbers > 1. A245688

Number of defective 4-colorings of an n X 4 0..3 array connected horizontally, vertically, diagonally and antidiagonally with exactly two mistakes, and colors introduced in row-major 0..3 order. A229751

Number of defective 4-colorings of an n X 5 0..3 array connected horizontally, vertically, diagonally and antidiagonally with exactly two mistakes, and colors introduced in row-major 0..3 order. A229752

Unique terms in sequence A294640, in order by size. A294641

Unique solution·of the congruence x² = -1 (mod m(n)), with m(n) = A002559(n) (Markoff numbers) in the interval [1, floor(m(n)/2)], assuming the Markoff uniqueness conjecture, for n >= 3. A324601