Properties of the Number 3755

Three Thousand Seven Hundred Fifty-Five

Basics

Value: 3754 → 3755 → 3756

Parity: odd

Prime: No

Previous Prime: 3739

Next Prime: 3761

Digit Sum: 20

Digital Root: 2

Palindrome: No

Factorization: 5 × 751

Divisors: 1, 5, 751, 3755

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: 111010101011

Octal: 7253

Duodecimal: 220B

Hexadecimal: eab

Square: 14100025

Square Root: 61.27805479941412

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

Composite and every divisor (except 1) contains the digit 5. A62672

Index of first occurrence of n in A307730. A348246

T(n,k) = number of ways to reciprocally link elements of an n X k array either to themselves or to exactly one king-move neighbor. A220644

Edge length of largest square dissectable into up to n squares in Mrs. Perkins's quilt problem. A89047

Semiprimes that are the sum of the first n semiprimes for some n. A92190

Numbers k such that A003313(k) = A003313(3·k). A116459

Dispersion of A004767 (4k+3, k>=0), by antidiagonals. A191669

T(n,k)=Number of nXk 0..1 arrays with each 1 adjacent to 0, 3 or 5 king-move neighboring 1s. A296834

Standard composition numbers of compositions whose maximal runs R all satisfy length(R) > first(R). A389515

a(n) = Sum_t t·F(n,t), where F(n,t) (see A095133) is the number of forests with n (unlabeled) nodes and exactly t trees. A5196