Properties of the Number 15485

Fifteen Thousand Four Hundred Eighty-Five

Basics

Value: 15484 → 15485 → 15486

Parity: odd

Prime: No

Previous Prime: 15473

Next Prime: 15493

Digit Sum: 23

Digital Root: 5

Palindrome: No

Factorization: 5 × 19 × 163

Divisors: 1, 5, 19, 95, 163, 815, 3097, 15485

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 11110001111101

Octal: 36175

Duodecimal: 8B65

Hexadecimal: 3c7d

Square: 239785225

Square Root: 124.43873994861889

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

Centered tetrahedral numbers. A5894

Number of permutations of length n avoiding the pattern 1342. A22558

T(n,k)=Number of permutations of 0..floor((n·k-1)/2) on even squares of an nXk array such that each row, column, diagonal and (downwards) antidiagonal of even squares is increasing. A215788

T(n,k) = Number of permutations of 0..floor((n·k-2)/2) on odd squares of an n X k array such that each row, column, diagonal and (downwards) antidiagonal of odd squares is increasing. A215870

T(n,k) = number of n-bead necklaces labeled with numbers -k..k allowing reversal, with sum zero and three times sum of squares <= n·k*(k+1). A208805

G.f. satisfies A(x) = 1 + x + x²*A(x)⁵. A137959

Irregular triangle: T(n,k) is the number of permutations in S_n that have exactly k occurrences of the pattern 4213. 0 <= k <= A342646(n). A342840

Irregular table read by rows: T(n,k) is the number of permutations in S_n that have exactly k occurrences of the pattern 2413. 0 <= k <= A342854(n). A342860

Number of partitions p of n such that median(p) >= mean(p). A240221

Number of regions formed in a square by straight line segments when connecting the n-1 points between each corner that divide each edge into n equal parts to the n-1 points on each of the two adjacent edges of the square. A358407