ℕ atory
Play Now

Properties of the Number 5201

Five Thousand Two Hundred One

Basics

Value: 5200 → 5201 → 5202

Parity: odd

Prime: No

Previous Prime: 5197

Next Prime: 5209

Digit Sum: 8

Digital Root: 8

Palindrome: No

Factorization: 7 × 743

Divisors: 1, 7, 743, 5201

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: 1010001010001

Octal: 12121

Duodecimal: 3015

Hexadecimal: 1451

Square: 27050401

Square Root: 72.11795892841117

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

Number of balls in pyramid with base either a regular hexagon or a hexagon with alternate sides differing by 1 (balls in hexagonal pyramid of height n taken from hexagonal close-packing). A19298
Centered 16-gonal numbers. A69129
Add/multiply sequence, see example. A93361
Array of ((kn)+(k-n))/2 where k=(sqrt(x2+1)+x)2 for integers x>=1. A188645
a(n) = a(n-1) + a(m) for n >= 4, where m = 2·n - 3 - 2p+1 and p is the smallest integer such that 2p < n - 1 <= 2p+1, starting with a(1) = a(2) = a(3) = 1. A50024
a(n) = a(n-1) + a(m) for n >= 4, where m = 2·n - 3 - 2p+1 and p is the unique integer such that 2p < n - 1 <= 2p+1, starting with a(1) = 1, a(2) = 2, and a(3) = 1. A50040
a(n) = a(n-1) + a(m) for n >= 4, where m = 2·n - 3 - 2p+1 and p is the unique integer such that 2p < n - 1 <= 2p+1, starting with a(1) = 1, a(2) = 3, and a(3) = 1. A50056
Numbers a(n) are obtained by the direct application of sieve of Eratosthenes for A000695: retaining A000695(2)=4, we delete all multiples of 4, which are more than 4; retaining A000695(3)=5, we delete all multiples of 5, which are more than 5, etc. A152021
Binomial transform of {b(n)}, where b(n)=1 for prime n and b(n)=0 otherwise. A52467
Partial sums of sequence (essentially A002378): 1, 2, 6, 12, 20, 30, 42, 56, 72, 90, ... A64999