Properties of the Number 61348

Sixty-One Thousand Three Hundred Forty-Eight

Basics

Value: 61347 → 61348 → 61349

Parity: even

Prime: No

Previous Prime: 61343

Next Prime: 61357

Digit Sum: 22

Digital Root: 4

Palindrome: No

Factorization: 2 ² × 7 ² × 313

Divisors: 1, 2, 4, 7, 14, 28, 49, 98, 196, 313

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1110111110100100

Octal: 167644

Duodecimal: 2B604

Hexadecimal: efa4

Square: 3763577104

Square Root: 247.68528418135784

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 nX2 arrays of the minimum value of corresponding elements and their horizontal and vertical neighbors in a random 0..1 nX2 array. A217631

Number of nX4 0..3 arrays with no element equal to one plus the sum of elements to its left or one plus the sum of elements above it or zero plus the sum of the elements diagonally to its northwest or one plus the sum of the elements antidiagonally to its northeast, modulo 4. A241431

a(n) = ∑_k=0..n-1 T(n,k) * T(n,2n-k), with T given by A027082. A27105

Numbers k such that 5·10^k + 59 is prime. A276492

T(n,k)=Number of nXk 0..3 arrays with no element equal to one plus the sum of elements to its left or one plus the sum of the elements above it or zero plus the sum of the elements diagonally to its northwest or one plus the sum of the elements antidiagonally to its northeast, modulo 4. A241435

T(n,k)=Number of nXk arrays of the minimum value of corresponding elements and their horizontal, diagonal or antidiagonal neighbors in a random 0..1 nXk array. A218897

T(n,k)=Number of nXk arrays of the minimum value of corresponding elements and their horizontal and vertical neighbors in a random 0..1 nXk array. A217637

Consider a (solid) triangle with n cells on each edge, for a total of n(n+1)/2 cells; a(n) is number of inequivalent ways of labeling cells with 0's and 1's; triangle may be rotated and turned over. A61348