Properties of the Number 16021

Sixteen Thousand Twenty-One

Basics

Value: 16020 → 16021 → 16022

Parity: odd

Prime: No

Previous Prime: 16007

Next Prime: 16033

Digit Sum: 10

Digital Root: 1

Palindrome: No

Factorization: 37 × 433

Divisors: 1, 37, 433, 16021

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 11111010010101

Octal: 37225

Duodecimal: 9331

Hexadecimal: 3e95

Square: 256672441

Square Root: 126.57408897558773

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 solutions to +-p(1)+-p(2)+-...+-p(2n)=1 where p(i) is the i-th prime. A113040

a(n) = (prime(n)² + 1)/2. A66885

E.g.f.: exp(∑_n>=1 d(n) * xⁿ), where d(n) is the number of divisors of n. A294363

Maximal coefficient of (1 + x²) * (1 + x³) * (1 + x⁵) * ... * (1 + x^prime(n)). A350457

Third row of Pascal-(1,5,1) array A081580. A81589

26-gonal numbers: a(n) = n*(12·n-11). A255185

Least k such that prime(n)² divides binomial(2k,k). A110494

Numbers which are the sum of two positive cubes and divisible by 37. A102618

Number of ways of partitioning the set of the first n primes into two subsets whose sums differ at most by 1. A306443

Odd composite integers m such that A054413(m-J(m,53)) == 0 (mod m), where J(m,53) is the Jacobi symbol. A340096