Properties of the Number 3057

Three Thousand Fifty-Seven

Basics

Value: 3056 → 3057 → 3058

Parity: odd

Prime: No

Previous Prime: 3049

Next Prime: 3061

Digit Sum: 15

Digital Root: 6

Palindrome: No

Factorization: 3 × 1019

Divisors: 1, 3, 1019, 3057

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: 101111110001

Octal: 5761

Duodecimal: 1929

Hexadecimal: bf1

Square: 9345249

Square Root: 55.29014378711634

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 rooted ternary trees with n nodes; number of n-carbon alkyl radicals C(n)H(2n+1) ignoring stereoisomers. A598

Number of primitive subsequences of {1, 2, ..., n}. A51026

a(n) = 3ⁿ reduced modulo 2ⁿ. A2380

Iterate the map in A006369 starting at 144. A185589

T(n,k)=Number of (n+2)X(k+2) 0..3 arrays with every 3X3 subblock row and diagonal sum equal to 0 2 4 6 or 7 and every 3X3 column and antidiagonal sum not equal to 0 2 4 6 or 7. A252433

G.f.: exp( ∑_n>=1 σ(4n)*xⁿ/n ). A182820

T(n,k)=Number of length n+2 0..k arrays with the sum of medians of adjacent triples multiplied by some arrangement of +-1 equal to zero. A253129

a(n) = ∑_{k=0..floor(n/2)} T(n,k), T given by A026780. A26788

T(n,k)=Number of nXk arrays containing k copies of 0..n-1 with every element equal to or 1 greater than any west or northeast neighbors modulo n and the upper left element equal to 0. A267742

a(n) = floor( γ(n+3/4) ). A14514