Properties of the Number 16257

Sixteen Thousand Two Hundred Fifty-Seven

Basics

Value: 16256 → 16257 → 16258

Parity: odd

Prime: No

Previous Prime: 16253

Next Prime: 16267

Digit Sum: 21

Digital Root: 3

Palindrome: No

Factorization: 3 × 5419

Divisors: 1, 3, 5419, 16257

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2730 Try Today's Challenge

Representations

Binary: 11111110000001

Octal: 37601

Duodecimal: 94A9

Hexadecimal: 3f81

Square: 264290049

Square Root: 127.50294114254777

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) = p² + p + 1 where p runs through the primes. A60800

Square array A(n,k), n >= 1, k >= 0, read by antidiagonals: A(n,k) = ∑_d∣n (-1)^n/d+d*d^k. A322083

a(n) = 4ⁿ - 2ⁿ + 1. A20515

T(n,k)=Hilltop maps: number of nXk binary arrays indicating the locations of corresponding elements not exceeded by any horizontal, diagonal or antidiagonal neighbor in a random 0..3 nXk array. A218638

T(n,k)=Hilltop maps: number of nXk binary arrays indicating the locations of corresponding elements not exceeded by any king-move neighbor in a random 0..3 nXk array. A218242

Numbers n such that the last 9 decimal digits of the n-th Fibonacci number is pandigital 1-9. A112371

a(n) = abs(2ⁿ-127). A176303

G.f.: exp( ∑_n>=1 A206152(n)*xⁿ/n ), where A206152(n) = ∑_k=0..n binomial(n,k)^n+k. A206151

Numbers n such that 81·2ⁿ-1 is prime. A50566

Triangular array read by rows: row s contains integers of the form (2^s+1)/(2^r+1) in order of increasing r <= s-1. A79665