Properties of the Number 5695

Five Thousand Six Hundred Ninety-Five

Basics

Value: 5694 → 5695 → 5696

Parity: odd

Prime: No

Previous Prime: 5693

Next Prime: 5701

Digit Sum: 25

Digital Root: 7

Palindrome: No

Factorization: 5 × 17 × 67

Divisors: 1, 5, 17, 67, 85, 335, 1139, 5695

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: 1011000111111

Octal: 13077

Duodecimal: 3367

Hexadecimal: 163f

Square: 32433025

Square Root: 75.46522377890362

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 integer partitions of n with an alternating permutation. A345170

a(n) = 20·a(n-1) - 64·a(n-2) - 45 for n>1; a(0) = 399, a(1) = 5695. A166915

T(n,k)=1/4 the number of (n+1)X(k+1) 0..3 arrays with every 2X2 subblock having at least two equal elements connected horizontally or vertically. A184153

Magic constants of 5 X 5 magic squares which consist of consecutive primes. A176571

T(n,k)=Number of nXk 0..1 arrays with every element unequal to 0, 1, 2, 5, 6 or 8 king-move adjacent elements, with upper left element zero. A316420

McKay-Thompson series of class 19A for Monster. A58549

Number of partitions p of n such that the multiplicity of (max(p) - min(p)) is a part. A240495

a(n) = F(n)*a(n-1) + a(n-2) with a(0) = 0, a(1) = 1. A135829

Decimal representation of the diagonal from the origin to the corner of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 531", based on the 5-celled von Neumann neighborhood. A288976

CONTINUANT transform of Fibonacci number 1, 2, 3, 5, 8, ... A71895