Properties of the Number 95401

Ninety-Five Thousand Four Hundred One

Basics

Value: 95400 → 95401 → 95402

Parity: odd

Prime: Yes

Previous Prime: 95393

Next Prime: 95413

Digit Sum: 19

Digital Root: 1

Palindrome: No

Factorization: 95401

Divisors: 1, 95401

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 10111010010101001

Octal: 272251

Duodecimal: 47261

Hexadecimal: 174a9

Square: 9101350801

Square Root: 308.8705230351385

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 permutations satisfying i-4<=p(i)<=i+4, i=1..n (permutations of length n within distance 4). A72856

a(n) = ∑_k=0..n (k!)² * Stirling₂(n,k)². A48144

Array read by antidiagonals: The number of parades with n girls and k boys that begin with a girl and end with a boy. A371761

Triangle read by rows: T(n,m) = ∑_i=0..m Stirling2(m+1,i+1)*(-1)^m-i*i^n-m*i!, for n >= 2, m = 1..n-1. A272644

G.f.: ∏_k>0 (1+x^k)/((1-x^k)*(1+x^3k)*(1+x^5k)). A100823

a(n) = largest term in row n of array in A272644. A272645

Largest prime with strictly ascending consecutive digits in base n. A344549

Triangle read by rows: chromatic invariant T(n,m) of the complete bipartite graph K_m,n. A291774

number of steps required to reach 1 if the following modified juggler map is iterated: a[n]=(1-Mod[n, 2])*Floor[n^3/4]+Mod[n, 2]*Floor[n^4/3]; original exponents {1/2, 3/2} are replaced with {3/4, 4/3}. A95401