Properties of the Number 10651

Ten Thousand Six Hundred Fifty-One

Basics

Value: 10650 → 10651 → 10652

Parity: odd

Prime: Yes

Previous Prime: 10639

Next Prime: 10657

Digit Sum: 13

Digital Root: 4

Palindrome: No

Factorization: 10651

Divisors: 1, 10651

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: 10100110011011

Octal: 24633

Duodecimal: 61B7

Hexadecimal: 299b

Square: 113443801

Square Root: 103.20368210485515

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

Indices in A146326 where records occur. A146345

Initial term in sequence of four consecutive primes separated by 3 consecutive differences each <=6 (i.e., when d = 2, 4 or 6) and forming d-pattern = [6, 6, 4]; short d-string notation of pattern = [664]. A78858

Primes of the form i·prime(i) + (i+1)*prime(i+1). A119487

E.g.f.: exp(∑_n>=1 A000009(n)*xⁿ). A293840

Next prime after n³. A14220

Smallest prime p > prime(n+2) such that p is a quadratic residue mod the first n odd primes 3, 5, 7, 11, ..., prime(n+1), and p is a quadratic non-residue mod prime(n+2). A96636

a(n) = n*(n-th prime) + (n+1)*((n+1)-th prime). A152117

a(n) = n³ + 3. A84378

Numbers that can be written in exactly two different ways as s₁^x_1 + ... + s_t^x_t, with 1 < s₁ < ... < s_t and {s₁,..., s_t} = {x₁,..., x_t} for some t > 0. A386966

Number of partitions of n such that the least part occurs exactly three times. A97091