Properties of the Number 95238

Ninety-Five Thousand Two Hundred Thirty-Eight

Basics

Value: 95237 → 95238 → 95239

Parity: even

Prime: No

Previous Prime: 95233

Next Prime: 95239

Digit Sum: 27

Digital Root: 9

Palindrome: No

Factorization: 2 × 3 ² × 11 × 13 × 37

Divisors: 1, 2, 3, 6, 9, 11, 13, 18, 22, 26

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 10111010000000110

Octal: 272006

Duodecimal: 47146

Hexadecimal: 17406

Square: 9070276644

Square Root: 308.60654562079526

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 (w,x,y,z) with all terms in {1,...,n} and w²>x·y*z. A212066

p-INVERT of (1,1,0,0,0,0,...), where p(S) = 1 - S - S³. A291397

a(n) = (20·n)!*(9·n)!*(6·n)!/((18·n)!*(10·n)!*(4·n)!*(3·n)!). A295476

Composite numbers such that the square root of the sum of squares of their prime factors is a prime. A134607

Number of length-5 0..n arrays with no repeated value differing from the previous repeated value by other than one. A269539

Multiples of 5291. A178027

Triangle T(n, k, m) = (m*(n-k) + 1)*T(n-1, k-1, m) + (m·k + 1)*T(n-1, k, m) - m·f(n,k)*T(n-2, k-1, m) with T(n, 0, m) = T(n, n, m) = 1, f(n, k) = k if k <= floor(n/2) otherwise n-k, and m = 1, read by rows. A157210

Number of partitions of n into at most 6 parts. A1402

T(n,k)=Number of length-n 0..k arrays with no repeated value differing from the previous repeated value by other than one. A269537

a(1) = 1, a(n) = n*(sum of all previous terms mod n). A95238