Properties of the Number 3895

Three Thousand Eight Hundred Ninety-Five

Basics

Value: 3894 → 3895 → 3896

Parity: odd

Prime: No

Previous Prime: 3889

Next Prime: 3907

Digit Sum: 25

Digital Root: 7

Palindrome: No

Factorization: 5 × 19 × 41

Divisors: 1, 5, 19, 41, 95, 205, 779, 3895

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2730 Try Today's Challenge

Representations

Binary: 111100110111

Octal: 7467

Duodecimal: 2307

Hexadecimal: f37

Square: 15171025

Square Root: 62.4099351065197

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 nodes in regular n-gon with all diagonals drawn. A7569

Maximal coefficient of the polynomial (1-x)*(1-x²)*...*(1-xⁿ). A86376

Number of forests of labeled rooted trees of height at most 1, with n labels, where any root may contain >= 1 labels, also row sums of A143395, A143396 and A143397. A143405

Positive integers m such that π(m²) = π(j²) + π(k²) for no 0 < j <= k < m. A262408

Number A(n,k) of tilings of a k X n rectangle using right trominoes and 1 X 1 tiles; square array A(n,k), n>=0, k>=0, read by antidiagonals. A220054

Number of tilings of a 3 X n board with 1 X 1 and L-shaped tiles (where the L-shaped tiles cover 3 squares). A127867

The maximum of the absolute value of the coefficients of Pn = (1-x)(1-x²)(1-x³)...(1-xⁿ). A160089

a(n) = r·a(ceiling(n/2))+s·a(floor(n/2)) with a(1)=1 and (r,s)=(3,1). A268524

Number T(n,k) of colored integer partitions of n using all colors of a k-set such that all parts have different color patterns and a pattern for part i has i distinct colors in increasing order; triangle T(n,k), n>=0, min(j:A001787(j)>=n)<=k<=n, read by rows. A326914

Number T(n,k) of colored integer partitions of n using all colors of a k-set such that all parts have different color patterns and a pattern for part i has i distinct colors in increasing order; triangle T(n,k), k>=0, k<=n<=k·2^k-1, read by columns. A326962