Properties of the Number 6205

Six Thousand Two Hundred Five

Basics

Value: 6204 → 6205 → 6206

Parity: odd

Prime: No

Previous Prime: 6203

Next Prime: 6211

Digit Sum: 13

Digital Root: 4

Palindrome: No

Factorization: 5 × 17 × 73

Divisors: 1, 5, 17, 73, 85, 365, 1241, 6205

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

8509 Try Today's Challenge

Representations

Binary: 1100000111101

Octal: 14075

Duodecimal: 3711

Hexadecimal: 183d

Square: 38502025

Square Root: 78.77182237323191

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

13-gonal (or tridecagonal) numbers: a(n) = n*(11·n - 9)/2. A51865

Numbers m that are the hypotenuse of exactly 13 distinct integer-sided right triangles, i.e., m² can be written as a sum of two squares in 13 ways. A97102

a(n) = (n⁵ - 5·n⁴ + 5·n³ + 5·n² + 114·n + 120)/120. A161701

Numbers k such that the initial k digits in decimal portion of π form a prime number. A47658

A total of n married couples, including a mathematician M and his wife, are to be seated at the 2n chairs around a circular table, with no man seated next to his wife. After the ladies are seated at every other chair, M is the first man allowed to choose one of the remaining chairs. The sequence gives the number of ways of seating the other men, with no man seated next to his wife, if M chooses the chair that is 9 seats clockwise from his wife's chair. A258667

Bases b where exactly six primes p with p < b exist such that p is a base-b Wieferich prime. A325882

a(0)=4; a(n)=n²+a(n-1) for n>0. A153058

T(n,k)=Number of nXk 0..1 arrays with no element equal to exactly two horizontal and vertical neighbors, with new values 0..1 introduced in row major order. A240519

T(n,k) = Number of n X k 0..1 arrays with every element equal to 1, 2, 3, 4, 5 or 7 king-move adjacent elements, with upper left element zero. A299142

Triangle read by rows: T(n,k) is the number of embeddings on the sphere of connected simple planar graphs with n nodes and k faces, n >= 1, k=1..max(1,2·n-4). A384963