Properties of the Number 37062

Thirty-Seven Thousand Sixty-Two

Basics

Value: 37061 → 37062 → 37063

Parity: even

Prime: No

Previous Prime: 37061

Next Prime: 37087

Digit Sum: 18

Digital Root: 9

Palindrome: No

Factorization: 2 × 3 ² × 29 × 71

Divisors: 1, 2, 3, 6, 9, 18, 29, 58, 71, 87

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1001000011000110

Octal: 110306

Duodecimal: 19546

Hexadecimal: 90c6

Square: 1373591844

Square Root: 192.51493448561334

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

Numbers n such that n²⁰⁴⁸ + 1 is prime (a generalized Fermat prime). A88361

Number of noncongruent integer-sided tetrahedra with largest side n. A97125

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 vertices in the resulting planar graph. A367117

a(n) = (1/3ⁿ) * ∑_k=0..n³ ( (binomial(n³, k) * 2^k) (mod 3ⁿ) ). A376536

Number of partitions of n with even number (or 0) 2's. A92295

Number of nX4 0..1 arrays with every element unequal to 1, 2, 3, 6 or 7 king-move adjacent elements, with upper left element zero. A305085

a(n)-th prime is the smallest prime containing exactly n 5's. A37062

Table read by antidiagonals: Place k points in general position on each side of a regular n-gon and join every pair of the n*(k+1) boundary points by a chord; T(n,k) (n >= 3, k >= 0) gives number of vertices in the resulting planar graph. A367183