Properties of the Number 36993

Thirty-Six Thousand Nine Hundred Ninety-Three

Basics

Value: 36992 → 36993 → 36994

Parity: odd

Prime: No

Previous Prime: 36979

Next Prime: 36997

Digit Sum: 30

Digital Root: 3

Palindrome: No

Factorization: 3 × 11 × 19 × 59

Divisors: 1, 3, 11, 19, 33, 57, 59, 177, 209, 627

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: 1001000010000001

Octal: 110201

Duodecimal: 194A9

Hexadecimal: 9081

Square: 1368482049

Square Root: 192.33564412245588

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

Diagonal in array of n-gonal numbers A081422. A81437

Alkane (or paraffin) numbers l(7,n). A5994

a(n) = n*(n+1)*(2·n²+1)/6. A71238

Take pairs (x,y) with ∑_{j = x..y} j = concatenation of·and y. Sort pairs on y then x. This sequence gives·of each pair. A70152

a(n)*a(n-9) = a(n-1)*a(n-8)+a(n-4)+a(n-5) with initial terms a(1)=...=a(9)=1. A133847

Number of pairs with two different elements which can be obtained by selecting unique elements from two sets with n+1 and n² elements respectively and n common elements. A85490

a(n) = 32·n² + 1. A158575

Odd numbers k such that the number of 1's in binary representation of k equals ω(k), the number of distinct primes in the factorization of k. A71595

a(n) is the n-th order Taylor polynomial (centered at 0) of S(x)^3·n evaluated at x = 1, where S(x) = (1 - x - sqrt(1 - 6·x + x²))/(2·x) is the o.g.f. of the Schröder numbers A006318. A333092

a(n)=least number that is cyclops for exactly n distinct bases b > 1. A285987