Properties of the Number 95901

Ninety-Five Thousand Nine Hundred One

Basics

Value: 95900 → 95901 → 95902

Parity: odd

Prime: No

Previous Prime: 95891

Next Prime: 95911

Digit Sum: 24

Digital Root: 6

Palindrome: No

Factorization: 3 × 13 × 2459

Divisors: 1, 3, 13, 39, 2459, 7377, 31967, 95901

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: 10111011010011101

Octal: 273235

Duodecimal: 475B9

Hexadecimal: 1769d

Square: 9197001801

Square Root: 309.67886592404074

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) = ∑_k=0..n (k+1)! binomial(n,k). A1339

Square array read by antidiagonals: form the Euler-Seidel matrix for the sequence {k!} and then divide column k by k!. A143409

Square array A(row,col) = ∑_k=0..row binomial(row,k)*(1+col+k)!, read by descending antidiagonals as A(0,0), A(0,1), A(1,0), A(0,2), A(1,1), A(2,0), ... A276588

Binomial triangle based on factorials. A76571

Transpose of A276588. A276589

Square array, read by antidiagonals, where the n-th row is the n-th binomial transform of the factorials, starting with row 0: {1!,2!,3!,...}. A89900

Triangle read by rows, T(n,k) = ∑_j=0..n-k+1 j!*C(n-1,j-1)*T(n-j,k-1) if k ≠ 0 else 1, n>=0, 0<=k<=n. A256895

Triangle read by rows, T(n,k) = ∑_j=0..n (-1)^n-j*C(-j,-n)*L(j,k), L the unsigned Lah numbers A271703, for n>=0 and 0<=k<=n. A271704

A004001 (mod 2). A95901

Xenodromes: all digits in base 8 are different. A23803