Properties of the Number 37470

Thirty-Seven Thousand Four Hundred Seventy

Basics

Value: 37469 → 37470 → 37471

Parity: even

Prime: No

Previous Prime: 37463

Next Prime: 37483

Digit Sum: 21

Digital Root: 3

Palindrome: No

Factorization: 2 × 3 × 5 × 1249

Divisors: 1, 2, 3, 5, 6, 10, 15, 30, 1249, 2498

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1001001001011110

Octal: 111136

Duodecimal: 19826

Hexadecimal: 925e

Square: 1404000900

Square Root: 193.57169214531345

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

a(n) = ∑_k=0..n T(n,k), T given by A026758. A26765

T(n,k) = Number of n-step self-avoiding walks on a k X k X k cube summed over all starting positions. A187162

a(n)=sqrt(A127856(n)). A127857

Number of 5-step self-avoiding walks on an n X n X n cube summed over all starting positions. A187166

Numbers k such that usigma(k) is a square and sets a new record for such squares. A64443

Number of binary strings of length n with equal numbers of 00011 and 01100 substrings. A164231

Triangle of coefficients of Hermite-like analog of A053120 Chebyshev's T(n, x) polynomials (powers of·in increasing order): p(x,n)=2·x*p(x,n-1)-n·p(x,n-2). A136665

Number of walks within N³ (the first octant of Z³) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 1), (-1, 1, 1), (1, 0, -1), (1, 0, 0), (1, 0, 1)}. A150446

Least number k such that kⁿ + k +/- 1 are twin primes, or 0 if no such k exists. A248081

Integers n such that the digit set of n² is {0,1,4,9}. A317579