Properties of the Number 37993

Thirty-Seven Thousand Nine Hundred Ninety-Three

Basics

Value: 37992 → 37993 → 37994

Parity: odd

Prime: Yes

Previous Prime: 37991

Next Prime: 37997

Digit Sum: 31

Digital Root: 4

Palindrome: No

Factorization: 37993

Divisors: 1, 37993

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: 1001010001101001

Octal: 112151

Duodecimal: 19BA1

Hexadecimal: 9469

Square: 1443468049

Square Root: 194.91793144808406

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

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

Primes p such that p's set of distinct digits is {3,7,9}. A108385

a(n) is the number of binary strings of length n such that no subsequence of length 5 or less contains 3 or more ones. A120118

Upper twin primes of upper twin prime index. A88463

Primes p such that continued fraction of (1 + sqrt(p))/2 has period 11: primes in A146335. A146356

a(n) = number of conjugacy classes in PSL₄(prime(n)). A124681

Number of 10-length words w over n-ary alphabet such that for every prefix z of w we have #(z,a_i) = 0 or #(z,a_i) >= #(z,a_j) for all j>i and #(z,a_i) counts the occurrences of the i-th letter in z. A213289

Number of n-length words w over 4-ary alphabet such that for every prefix z of w we have #(z,a_i) = 0 or #(z,a_i) >= #(z,a_j) for all j>i and #(z,a_i) counts the occurrences of the i-th letter in z. A213292

Triangular array read by rows. T(n,k) is the number of functions on n unlabeled nodes that have exactly k unique components (n >= 1, k >= 1). A217859

Odd numbers of the form p^1+4k * r², where p is prime of the form 1+4m, r > 1, and gcd(p,r) = 1 that are closer to being perfect than previous terms. A228059