Properties of the Number 92378

Ninety-Two Thousand Three Hundred Seventy-Eight

Basics

Value: 92377 → 92378 → 92379

Parity: even

Prime: No

Previous Prime: 92377

Next Prime: 92381

Digit Sum: 29

Digital Root: 2

Palindrome: No

Factorization: 2 × 11 × 13 × 17 × 19

Divisors: 1, 2, 11, 13, 17, 19, 22, 26, 34, 38

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2730 Try Today's Challenge

Representations

Binary: 10110100011011010

Octal: 264332

Duodecimal: 45562

Hexadecimal: 168da

Square: 8533694884

Square Root: 303.9374935739255

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) = binomial(n, floor(n/2)). A1405

a(n) = binomial(2·n+1, n+1): number of ways to put n+1 indistinguishable balls into n+1 distinguishable boxes = number of (n+1)-st degree monomials in n+1 variables = number of monotone maps from 1..n+1 to 1..n+1. A1700

Total number of leaves in all rooted ordered trees with n edges. A88218

The number of Motzkin n-paths with exactly one flat step. A138364

a(n) = binomial coefficient C(n,9). A582

GCD of consecutive central binomial coefficients: a(n) = gcd(A001405(n+1), A001405(n)). A57977

Right-hand side of odd-numbered rows of Pascal's triangle. A111418

a(n) = binomial(n, floor((n-1)/2)). A37952

Triangle read by rows: T(n,k) = C(2·n - k,n), 0 <= k <= n. A92392

Triangle read by rows. T(n, k) = binomial(n+k-1, k) for 0 <= k <= n. A59481