Properties of the Number 36995

Thirty-Six Thousand Nine Hundred Ninety-Five

Basics

Value: 36994 → 36995 → 36996

Parity: odd

Prime: No

Previous Prime: 36979

Next Prime: 36997

Digit Sum: 32

Digital Root: 5

Palindrome: No

Factorization: 5 × 7 ² × 151

Divisors: 1, 5, 7, 35, 49, 151, 245, 755, 1057, 5285

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: 1001000010000011

Octal: 110203

Duodecimal: 194AB

Hexadecimal: 9083

Square: 1368630025

Square Root: 192.3408432964772

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

Sum of all the parts in the partitions of n into 6 parts. A308867

a(n) is the total sum of semiperimeters over all (>=,>=)-polyominoes of length n. A382988

Number of n X 8 binary arrays with every 1 having exactly three king-move neighbors equal to 1. A183455

Number of basic magic carpets on n points. A55055

a(1)=a(2)=1, a(n)=a(n-1)+a(n-2) if n is odd, a(n)=a(n-1)+a(n/2) if n is even. A78912

Number of n X n binary arrays with every 1 having exactly three king-move neighbors equal to 1. A183451

Smallest k for which the number of divisors d of k such that τ(d·k) = τ(k/d + d) is equal to n, where τ = A000005. A392550

a(n) = smallest k >= 1 such that {1ⁿ, 2ⁿ, 3ⁿ, ..., kⁿ} can be partitioned into two sets with equal sum. A19568

T(n,k) = Number of n X k binary arrays with every 1 having exactly three king-move neighbors equal to 1. A183456

Number of inequivalent 9 X 9 matrices with entries from [n], where equivalence means permutations of rows or columns. A246110