Properties of the Number 16401

Sixteen Thousand Four Hundred One

Basics

Value: 16400 → 16401 → 16402

Parity: odd

Prime: No

Previous Prime: 16381

Next Prime: 16411

Digit Sum: 12

Digital Root: 3

Palindrome: No

Factorization: 3 × 7 × 11 × 71

Divisors: 1, 3, 7, 11, 21, 33, 71, 77, 213, 231

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 100000000010001

Octal: 40021

Duodecimal: 95A9

Hexadecimal: 4011

Square: 268992801

Square Root: 128.06638903318856

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

The n-th n-gonal number: a(n) = n*(n² - 3·n + 4)/2. A60354

Heinz numbers of integer partitions whose reciprocal sum is 1. A316855

Heinz numbers of aperiodic integer partitions into relatively prime parts whose reciprocal sum is 1. A316888

Centered 20-gonal (or icosagonal) numbers. A69133

a(n) = (5·3ⁿ-3)/2. A134931

Triangle read by rows: Hultman numbers: a(n,k) is the number of permutations of n elements whose cycle graph (as defined by Bafna and Pevzner) contains k cycles for n >= 0 and 1 <= k <= n+1. A164652

a(n) = 3*(a(n-2) + 1), with a(0) = 1, a(1) = 3. A87503

Numbers k > 1 such that, in base 8, k and k² contain the same digits in the same proportion. A61662

T(n,k)=Number of (n+1)X(k+1) arrays of permutations of 0..(n+1)*(k+1)-1 with each element having directed index change 0,1 0,-1 0,2 1,0 or -1,0. A264257

A051838 gives numbers m such that the sum of first m primes divides the product of the first m primes. This sequence gives corresponding values of the sum of first m primes. A140763