Properties of the Number 3752

Three Thousand Seven Hundred Fifty-Two

Basics

Value: 3751 → 3752 → 3753

Parity: even

Prime: No

Previous Prime: 3739

Next Prime: 3761

Digit Sum: 17

Digital Root: 8

Palindrome: No

Factorization: 2 ³ × 7 × 67

Divisors: 1, 2, 4, 7, 8, 14, 28, 56, 67, 134

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: 111010101000

Octal: 7250

Duodecimal: 2208

Hexadecimal: ea8

Square: 14077504

Square Root: 61.25357132445422

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) = 6·n² + 2 for n > 0, a(0)=1. A5897

a(n) = 4·n² - 3·n + 1. A54552

Numbers n such that (n⁹⁷-1)/(n-1) is prime. A217089

Limiting reverse row of the array A274190. A274199

T(n,k) = Number of n X k 0..1 arrays with the number of 1s horizontally or antidiagonally adjacent to some 0 one less than the number of 0's adjacent to some 1. A285152

Maximum sum of products of successive pairs in a permutation of order n+1. A101986

T(n,k)=Number of arrays of n+2 integers in -k..k with sum zero and the sum of every adjacent pair being odd. A202076

Least integer b>2n+1 such that the numbers written as [1,3,...,2n-1,2n+1] and [2n+1,2n-1,...,3,1] in base b are both prime. A218465

T(n,k)=Number of (n+2)X(k+2) 0..1 arrays with the (lower) medians of each row unequal to its neighbors and each column equal to its neighbors. A238026

When F is the Fermat point of a triangle ABC, this sequence lists the integer total distances FA + FB + FC corresponding to primitive triangles in A336328. A336329