Properties of the Number 37905

Thirty-Seven Thousand Nine Hundred Five

Basics

Value: 37904 → 37905 → 37906

Parity: odd

Prime: No

Previous Prime: 37897

Next Prime: 37907

Digit Sum: 24

Digital Root: 6

Palindrome: No

Factorization: 3 × 5 × 7 × 19 ²

Divisors: 1, 3, 5, 7, 15, 19, 21, 35, 57, 95

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1001010000010001

Octal: 112021

Duodecimal: 19B29

Hexadecimal: 9411

Square: 1436789025

Square Root: 194.69206455323237

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 k such that k² contains every digit at least once. A54038

Numbers n such that n² contains every decimal digit exactly once. A156977

Number of ways to partition digits 0-9 into signed terms in decreasing absolute value order with sum n. A389952

a(n) is the number of primes q <= A080082(n) such that prime(n) divides q + 1. A390840

Number of (2+1) X (n+1) arrays of permutations of 0..n·3+2 with each element having directed index change -1,-1 1,0 -1,-2 -2,-2 or 0,1. A264677

Number of planar n X n X n binary triangular grids symmetric both under 120 degree rotation and reflection with no more than 5 ones in any 4 X 4 X 4 subtriangle. A153943

a(n) is the smallest k such that the sum of squares of prime divisors of k is equal to the sum of prime divisors of n+k. A228182

Number of (n+1)X(2+1) 0..2 arrays with every 2X2 subblock diagonal maximum minus antidiagonal maximum unequal to its neighbors horizontally and vertically. A253726

a(n) = 9 - (floor(n*π) mod 9). A37905