Properties of the Number 5163

Five Thousand One Hundred Sixty-Three

Basics

Value: 5162 → 5163 → 5164

Parity: odd

Prime: No

Previous Prime: 5153

Next Prime: 5167

Digit Sum: 15

Digital Root: 6

Palindrome: No

Factorization: 3 × 1721

Divisors: 1, 3, 1721, 5163

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1010000101011

Octal: 12053

Duodecimal: 2BA3

Hexadecimal: 142b

Square: 26656569

Square Root: 71.85401867675878

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

D-toothpick sequence of the third kind starting with a single toothpick. A220500

Coordination sequence for (2,4,5) tiling of hyperbolic plane. A265060

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

Positions of 3's in A264977; positions of 6's in A277330. A277713

Number of strict integer partitions of n where some part is a difference of two consecutive parts. A364536

Numbers k such that k¹⁰ == 1 (mod 11³). A56085

Number T(n, k) of ways to place k points on an n X n X n triangular grid so that no pair of them has distance sqrt(3). Triangle read by rows. A244500

Integers k such that there exists an integer 0<m<k such that σ(m)² + σ(k)² = (m+k)². A383484

a(1)= 1; a(2)= 5; thereafter a(n)= a(n-1) + a(n-2) + 5. A166863

Riordan's general Eulerian recursion: T(n,k) = (k+2)*T(n-1, k) + (n-k) * T(n-1, k-1), with T(n,0) = 1, T(n,n) = 0. A157012