Properties of the Number 37423

Thirty-Seven Thousand Four Hundred Twenty-Three

Basics

Value: 37422 → 37423 → 37424

Parity: odd

Prime: Yes

Previous Prime: 37409

Next Prime: 37441

Digit Sum: 19

Digital Root: 1

Palindrome: No

Factorization: 37423

Divisors: 1, 37423

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1001001000101111

Octal: 111057

Duodecimal: 197A7

Hexadecimal: 922f

Square: 1400480929

Square Root: 193.45025200293745

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

Primes from merging of 5 successive digits in decimal expansion of e. A104846

Sum T(n,k) of the entries in the k-th blocks of all set partitions of [n]; triangle T(n,k), n>=1, 1<=k<=n, read by rows. A285362

T(n,k)=Number of nXk 0..1 arrays with no 1 adjacent to 3 king-move neighboring 1s. A297094

Place n points in general position on each side of an equilateral triangle, and join every pair of the 3·n+3 boundary points by a chord; sequence gives number of regions in the resulting planar graph. A367118

Primes p such that p-1 and p+1 are both divisible by fourth powers. A86709

a(n) = ∑_k=1..n (-1)^n-k*binomial(n,k)*σ(k). A320568

Number of elements in Z[ ω ] whose 'smallest algorithm' is <= n, where ω² = -ω - 1. A6458

Primes that remain prime through 3 iterations of function f(x) = 8x + 5. A23293

T(n,k)=number of nXk arrays containing k indistinguishable copies of 1..n with lexicographical ordering of rows strictly increasing and columns strictly decreasing. A180843

Primes 8k + 7 at the end of the maximal gaps in A269519. A269521