Properties of the Number 15251

Fifteen Thousand Two Hundred Fifty-One

Basics

Value: 15250 → 15251 → 15252

Parity: odd

Prime: No

Previous Prime: 15241

Next Prime: 15259

Digit Sum: 14

Digital Root: 5

Palindrome: Yes

Factorization: 101 × 151

Divisors: 1, 101, 151, 15251

Polygonal

Triangular: No

Square: No

Pentagonal: Yes

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 11101110010011

Octal: 35623

Duodecimal: 89AB

Hexadecimal: 3b93

Square: 232593001

Square Root: 123.49493916756265

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

Bruckman-Lucas pseudoprimes: k | (L_k - 1), where k is composite and L_k = Lucas numbers A000032. A5845

Odd Fibonacci pseudoprimes: odd composite numbers k such that either (1) k divides Fibonacci(k-1) if k == +-1 (mod 5) or (2) k divides Fibonacci(k+1) if k == +-2 (mod 5). A81264

Expansion of x*(1+x)/(1-x²-2·x³). A159284

Composite numbers k such that k divides F(k-1) where F(j) are the Fibonacci numbers. A69106

Palindromes k such that 3k + 1 is also a palindrome. A83829

Odd composite integers m such that F(m)² == 1 (mod m), where F(m) is the m-th Fibonacci number. A337231

Composite n coprime to 5 such that Fibonacci(n) == Legendre(n,5) (mod n). A49062

Primitive part of Lucas(n). A61447

Odd composites m that divide Fibonacci(m)-1. A94394

Semiprimes of the form n*(3·n-1)/2. A245365