Properties of the Number 60392

Sixty Thousand Three Hundred Ninety-Two

Basics

Value: 60391 → 60392 → 60393

Parity: even

Prime: No

Previous Prime: 60383

Next Prime: 60397

Digit Sum: 20

Digital Root: 2

Palindrome: No

Factorization: 2 ³ × 7549

Divisors: 1, 2, 4, 8, 7549, 15098, 30196, 60392

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2730 Try Today's Challenge

Representations

Binary: 1110101111101000

Octal: 165750

Duodecimal: 2AB48

Hexadecimal: ebe8

Square: 3647193664

Square Root: 245.7478382407463

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

T(n,k)=Number of (n+2)X(k+2) 0..1 arrays with every 3X3 subblock diagonal sum minus antidiagonal median nondecreasing horizontally and vertically. A253820

G.f. satisfies: A(x) = ∏_n>=1 (1 + xⁿ*A(x)²)/(1 - xⁿ*A(x)²). A192621

Expansion of -(10·x² - 6·x + 1)*sqrt(1 - 4·x)/(3·x - 1)². A320825

Number of (n+2)X(2+2) 0..1 arrays with every 3X3 subblock diagonal sum minus antidiagonal median nondecreasing horizontally and vertically. A253814

Number of (n+2)X(3+2) 0..1 arrays with every 3X3 subblock diagonal sum minus antidiagonal median nondecreasing horizontally and vertically. A253815

Self-locating numbers within the decimal expansion of log(2): strings k beginning at position k (first digit after decimal point is position 2). A332492

Let f(m) = smallest prime that divides k² + k + m for k = 0,1,2,...; sequence gives smallest m >= 0 such that f(m) is the n-th prime. A60392