Properties of the Number 36814

Thirty-Six Thousand Eight Hundred Fourteen

Basics

Value: 36813 → 36814 → 36815

Parity: even

Prime: No

Previous Prime: 36809

Next Prime: 36821

Digit Sum: 22

Digital Root: 4

Palindrome: No

Factorization: 2 × 79 × 233

Divisors: 1, 2, 79, 158, 233, 466, 18407, 36814

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1000111111001110

Octal: 107716

Duodecimal: 1937A

Hexadecimal: 8fce

Square: 1355270596

Square Root: 191.86974748511034

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

T(n,k)=Number of 0..3 arrays of length n+2·k-1 with sum no more than 3·k in any length 2k subsequence (=50% duty cycle). A212471

Number of 0..3 arrays of length n+7 with sum no more than 12 in any length 8 subsequence (=50% duty cycle). A212467

Number of 0..3 arrays of length 2·n with sum no more than 3·n in any length 2n subsequence (=50% duty cycle). A212472

Consider the base-5 Kaprekar map n->K(n) defined in A165032. Sequence gives numbers belonging to cycles, including fixed points. A165037

Length of cycle mentioned in A165037. A165038

Number of partitions satisfying (cn(1,5) = cn(4,5) and cn(1,5) <= cn(2,5) and cn(1,5) <= cn(3,5)). A36814

A triangular sequence from a vector a(n) times a triangular tensor t(n,m): T(n,m)=a(n).t(n,m); a(n)=Fibonacci(n);A000045(n): t(n,m)=Binomial(n,GCD(n,m)). A140835