Properties of the Number 61390

Sixty-One Thousand Three Hundred Ninety

Basics

Value: 61389 → 61390 → 61391

Parity: even

Prime: No

Previous Prime: 61381

Next Prime: 61403

Digit Sum: 19

Digital Root: 1

Palindrome: No

Factorization: 2 × 5 × 7 × 877

Divisors: 1, 2, 5, 7, 10, 14, 35, 70, 877, 1754

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: 1110111111001110

Octal: 167716

Duodecimal: 2B63A

Hexadecimal: efce

Square: 3768732100

Square Root: 247.77005468780928

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 (s(0), s(1), ..., s(2n+1)) such that 0 < s(i) < 9 and |s(i) - s(i-1)| = 1 for i = 1,2,...,2n+1, s(0) = 3, s(2n+1) = 4. A94832

Number of partitions of {1...n} containing 4 detached pairs of consecutive integers, i.e., partitions in which only 1- or 2-strings of consecutive integers can appear in a block and there are exactly four 2-strings. A105490

Expansion of x*(1+x) / (1-3·x²-x³). A188022

Irregular triangle read by rows: Whitney numbers of the second kind a(n,k), n >= 1, k >= 0, for the star poset. A7799

Square array T, read by antidiagonals: T(n,k) = 0 if n-k >=3 or if k-n >= 6, T(2,0) = T(1,0) = T(0,0) = T(0,1) = T(0,2) = T(0,3) = T(0,4) = T(0,5) = 1, T(n,k) = T(n-1,k) + T(n,k-1). A217765

Use same rules as A047988. Sequence gives smallest numbers which require n steps to reach 2. A61390