Properties of the Number 10251

Ten Thousand Two Hundred Fifty-One

Basics

Value: 10250 → 10251 → 10252

Parity: odd

Prime: No

Previous Prime: 10247

Next Prime: 10253

Digit Sum: 9

Digital Root: 9

Palindrome: No

Factorization: 3 ² × 17 × 67

Divisors: 1, 3, 9, 17, 51, 67, 153, 201, 603, 1139

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: 10100000001011

Octal: 24013

Duodecimal: 5B23

Hexadecimal: 280b

Square: 105083001

Square Root: 101.24722218411723

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

Cardinality of set of sets of parts of all partitions of n. A88314

Number of integer partitions of n that are constant or whose part multiplicities, except possibly the first and last, are all even. A349060

a(n) = 3·a(n-2) - a(n-3) with a(0)=0, a(1)=3, a(2)=0. A214699

Vampire numbers: (definition 1): n has a nontrivial factorization using n's digits. A20342

Dying rabbits: a(n) = a(n-1) + a(n-2) - a(n-4). A23434

n satisfying σ(n+1) = σ(n-1). A55574

a(n) = 6·n² + 4·n + 1. A80859

Number of partitions of n containing a clique of size 4. A183561

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

Let p and q be two prime numbers, not necessarily consecutive, such that q - p = 2n; a(n) is the number of distinct partitions of 2n into even numbers so that each partition corresponds to a consecutive prime difference pattern (k-tuple) and p<=A000230(n). Multiple occurrences of a partition are not counted. A79024