Properties of the Number 16465

Sixteen Thousand Four Hundred Sixty-Five

Basics

Value: 16464 → 16465 → 16466

Parity: odd

Prime: No

Previous Prime: 16453

Next Prime: 16477

Digit Sum: 22

Digital Root: 4

Palindrome: No

Factorization: 5 × 37 × 89

Divisors: 1, 5, 37, 89, 185, 445, 3293, 16465

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 100000001010001

Octal: 40121

Duodecimal: 9641

Hexadecimal: 4051

Square: 271096225

Square Root: 128.3160161476345

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

Triangle of numbers T(n,k) = number of permutations of (1,2,...,n) with longest increasing subsequence of length k (1<=k<=n). A47874

Number of compositions of n such that every restriction to a circular subinterval has a different sum. A325679

Numbers whose square can be represented in exactly two ways as the sum of a positive square and a positive fourth power. A345700

Numbers in A152022 which are not products of terms of A152021. A152023

T(n,k)=Majority value maps: number of nXk binary arrays indicating the locations of corresponding elements equal to at least half of their king-move neighbors in a random 0..1 nXk array. A220217

Sums of 4 distinct powers of 4. A38472

Number of ways to partition 1 into distinct reduced fractions i/j with j <= n. A154888

Number of permutations of length n with longest increasing subsequence of length 6. A1457

Triangle of numbers read by rows: T(n,k) = number of permutations σ of (1,2,...,n) with n - {length of longest increasing subsequence in σ} = k (0<=k<=n-1). A126065

Principal diagonal of the convolution array A213838. A213839