Properties of the Number 3805

Three Thousand Eight Hundred Five

Basics

Value: 3804 → 3805 → 3806

Parity: odd

Prime: No

Previous Prime: 3803

Next Prime: 3821

Digit Sum: 16

Digital Root: 7

Palindrome: No

Factorization: 5 × 761

Divisors: 1, 5, 761, 3805

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: 111011011101

Octal: 7335

Duodecimal: 2251

Hexadecimal: edd

Square: 14478025

Square Root: 61.68468205316454

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

Number of unlabeled rooted semi-identity trees with n nodes. A306200

Numbers n such that the decimal expansions of both n and n² have 0 as smallest digit and 8 as largest digit. A256708

Number of partitions of n such that (greatest part) - (least part) = number of parts. A237832

Partial sums of gcd-sum sequence A018804. A272718

T(n,k)=Number of nXk 0..3 arrays with no element equal to one plus the sum of elements to its left or two plus the sum of the elements above it, modulo 4. A239405

O.g.f. A(x) satisfies: 0 = [xⁿ] exp( n² * Integral A(x)² dx ) / A(x), for n > 0. A305139

Path-counting triangular array T(i,j), read by rows, obtained from array t in A038792 by T(i,j) = t(2·i-j, j) (for i >= 1 and 1 <= j <= i). A38730

Number of polyhexes of class PF2. A30534

Number of partitions of n where the difference between consecutive parts is at most 3. A238863

Triangle read by rows: T(n,k), n >=1, 0 <= k <= C(n,k), = number of n X n symmetric positive semi-definite matrices with 2's on the main diagonal and 1's and 0's elsewhere and with k 1's above the diagonal. A83029