Properties of the Number 14477

Fourteen Thousand Four Hundred Seventy-Seven

Basics

Value: 14476 → 14477 → 14478

Parity: odd

Prime: No

Previous Prime: 14461

Next Prime: 14479

Digit Sum: 23

Digital Root: 5

Palindrome: No

Factorization: 31 × 467

Divisors: 1, 31, 467, 14477

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 11100010001101

Octal: 34215

Duodecimal: 8465

Hexadecimal: 388d

Square: 209583529

Square Root: 120.3204055844228

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 inseparable partitions of n; see Comments. A325535

T(n,k)=Number of arrangements of n+1 numbers x(i) in -k..k with the sum of x(i)*x(i+1) equal to zero. A188358

Number of self-avoiding walks on square lattice trapped after n steps. A77482

Operation count to create all permutations of n distinct elements using Algorithm L (lexicographic permutation generation) from Knuth's The Art of Computer Programming, Vol. 4, chapter 7.2.1.2. Sequence gives number of times l has to be repeatedly decreased in step L3. A80047

Number of partitions of n such that (greatest part) + (least part) = number of parts. A237869

Numbers n such that n = concatenate(a, b) and σ(a) + σ(b) = σ(n) - n. A239562

AbsoluteValue(Numerator(Bernoulli(2n))) mod denominator(Bernoulli(2n)). A180315

a(n) = ∑_k=0..n T(n,k), T given by A026725. A26732

Number of ways of numbering the vertices of a cube so sum of the 8 numbers is n. A39959

AbsoluteValue(Numerator(Bernoulli(4n))) - Numerator(Bernoulli(4n)) mod denominator(Bernoulli(4n)) divided by two. A180320