Properties of the Number 16247

Sixteen Thousand Two Hundred Forty-Seven

Basics

Value: 16246 → 16247 → 16248

Parity: odd

Prime: No

Previous Prime: 16231

Next Prime: 16249

Digit Sum: 20

Digital Root: 2

Palindrome: No

Factorization: 7 × 11 × 211

Divisors: 1, 7, 11, 77, 211, 1477, 2321, 16247

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: 11111101110111

Octal: 37567

Duodecimal: 949B

Hexadecimal: 3f77

Square: 263965009

Square Root: 127.46372032857036

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

First term of n-th difference sequence of (floor(k·r)), r = sqrt(3), k >= 0. A325666

Number of partitions of n containing at least one part m-3 if m is the largest part. A212543

a(n) = 4·a(n-1) - 7·a(n-2) + 8·a(n-3) - 4·a(n-4) starting 0, 1, 4, 7. A215458

Generalized sum of divisors function: third diagonal of A060044. A60045

Numbers k such that the first 9 digits of the k-th Lucas number are 1-9 pandigital. A216489

Number of 2 X n 0..1 arrays with every 1 horizontally, diagonally or antidiagonally adjacent to 1 or 4 neighboring 1s. A297583

Admirable totient numbers: numbers that are equal to the sum of their iterated φ, with one of them taken with a minus sign. A335121

The binary expansion of a(n) tracks where the merge operations occurs in a Tim sort algorithm applied to n blocks. A376613

Least odd k such that C(2k, k) == 1 (mod A007775(n)), or 0 if no such k exists. A373469

Expansion of 1/((1-x) * (1-6·x) * (1-11·x)). A16247