Properties of the Number 16483

Sixteen Thousand Four Hundred Eighty-Three

Basics

Value: 16482 → 16483 → 16484

Parity: odd

Prime: No

Previous Prime: 16481

Next Prime: 16487

Digit Sum: 22

Digital Root: 4

Palindrome: No

Factorization: 53 × 311

Divisors: 1, 53, 311, 16483

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 100000001100011

Octal: 40143

Duodecimal: 9657

Hexadecimal: 4063

Square: 271689289

Square Root: 128.38613632320275

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

Least k such that there are exactly n ways to choose a sequence of divisors, one of each element of the multiset of prime indices of k (with multiplicity). A355732

Values of n such that L(20) and N(20) are both prime, where L(k) = (n²+n+1)*2^2·k + (2·n+1)*2^k + 1, N(k) = (n²+n+1)*2^k + n. A227523

Numbers m such that the positive values of m - A002110(k) are all primes (k > 0). A68372

Potential magic constants of 9 X 9 magic squares composed of consecutive primes. A191679

Number of partitions of n with difference -6 between the number of odd parts and the number of even parts, both counted without multiplicity. A242686

Years >= 1801 in which Christmas falls in Sukkot. A222419

G.f. satisfies: A(x) = ∑_n>=0 xⁿ*g_n(x)ⁿ where g_n(x) = A(x) - xⁿ*g_n(x)ⁿ for n>=0. A187010

Consider the 2^n-1 monic polynomials f(x) with coefficients 0 or 1, degree n and f(0)=1. Sequence gives triangle read by rows, in which T(n,k) (n>=1) is the number of such polynomials of thickness k (2 <= k <= n+1). A169940

Number of j (0 <= j <= n) such that the central binomial coefficient C(n,floor(n/2)) = A001405(n) is divisible by C(n,j). A80383

Continued fraction for log(55). A16483