Properties of the Number 95231

Ninety-Five Thousand Two Hundred Thirty-One

Basics

Value: 95230 → 95231 → 95232

Parity: odd

Prime: Yes

Previous Prime: 95219

Next Prime: 95233

Digit Sum: 20

Digital Root: 2

Palindrome: No

Factorization: 95231

Divisors: 1, 95231

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 10111001111111111

Octal: 271777

Duodecimal: 4713B

Hexadecimal: 173ff

Square: 9068943361

Square Root: 308.5952041104981

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

Decimal representation of the diagonal from the origin to the corner of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 169", based on the 5-celled von Neumann neighborhood. A286174

Decimal representation of the diagonal from the origin to the corner of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 353", based on the 5-celled von Neumann neighborhood. A287760

Primes whose index is divisible by the product of its digits. A306766

Lesser of twin primes p1 such that p1·p2-4 and p1·p2-6 are twin prime numbers. A174957

Number of (n+1)X(7+1) 0..1 arrays with nondecreasing x(i,j)+x(i,j-1) in the i direction and nondecreasing min(x(i,j),x(i-1,j)) in the j direction. A250728

Number of n X n binary arrays symmetric under 180 degree rotation with all ones connected only in a 00100-00100-11111 pattern in any orientation. A147002

T(n,k)=Number of (n+1)X(k+1) 0..1 arrays with nondecreasing x(i,j)+x(i,j-1) in the i direction and nondecreasing min(x(i,j),x(i-1,j)) in the j direction. A250729

a(1)=1; a(n)=least positive integer such that the concatenation of all terms, including a(n), is == 1 (mod n). A95231