Properties of the Number 14689

Fourteen Thousand Six Hundred Eighty-Nine

Basics

Value: 14688 → 14689 → 14690

Parity: odd

Prime: No

Previous Prime: 14683

Next Prime: 14699

Digit Sum: 28

Digital Root: 1

Palindrome: No

Factorization: 37 × 397

Divisors: 1, 37, 397, 14689

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 11100101100001

Octal: 34541

Duodecimal: 8601

Hexadecimal: 3961

Square: 215766721

Square Root: 121.19818480488888

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

T(n,k)=Number of nonnegative integer arrays of length n+2k+1 with new values 0 upwards introduced in order, no three adjacent elements all unequal, and containing the value k+1. A211849

24-gonal numbers: a(n) = n*(11·n-10). A51876

Numbers that are the sum of 4 nonzero 4th powers in more than one way. A309763

Numbers that are the sum of four fourth powers in exactly two ways. A344193

a(n) = ∑_k=0..n-1 binomial(4·k+1,k) * binomial(4·n-4·k,n-k-1). A386612

Let a,b be prime numbers satisfying the Diophantine equation a³+b³=(a+b)*(a²-a·b+b²)=c². Then the second factor a²-a·b+b² is 3·e² for some integer e. This sequence tabulates the 'e' values, sorted by magnitude of c. A99809

Concatenation of first n nonprime numbers. A132934

Numbers n such that gcd(φ(n), n-1) > λ(n). A283656

A373711(n) is equal to the a(n)-th A379973(n)-gonal number. A379974

Pseudoprimes to base 14. A20142