Properties of the Number 14769

Fourteen Thousand Seven Hundred Sixty-Nine

Basics

Value: 14768 → 14769 → 14770

Parity: odd

Prime: No

Previous Prime: 14767

Next Prime: 14771

Digit Sum: 27

Digital Root: 9

Palindrome: No

Factorization: 3 ³ × 547

Divisors: 1, 3, 9, 27, 547, 1641, 4923, 14769

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

8509 Try Today's Challenge

Representations

Binary: 11100110110001

Octal: 34661

Duodecimal: 8669

Hexadecimal: 39b1

Square: 218123361

Square Root: 121.52777460317456

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 read by rows: T(n,k) is the number of sets of noncrossing paths of size k whose nodes are a subset of n nodes arranged in a circle with one node paths allowed, 0 <= k <= n. A390897

Number of n-step three-sided prudent self-avoiding walks ending on the bottom side of their box. A191825

a(n) is the least positive integer such that nextprime(a(n)ⁿ) - prevprime(a(n)ⁿ) = 4. A90125

Expansion of 1/(1 - x + x⁴). A99530

Numbers n such that n and n+1 are differences between 2 positive cubes in at least one way. A38594

Number of vertices in truncated tetrahedron with faces that are centered polygons. A193218

Triangle read by rows: T(n,k) appears in the transformation ∑_k=0..n (k+1)*x^k = ∑_k=0..n T(n,k)*(x+k)^k. A247236

Expansion of e.g.f. x·exp(x)*(cosh(x))². A360023

Number of self-avoiding paths with nodes chosen among n given points on a circle; one-node paths are allowed. A360715

Numbers k such that (17·10^k-1 - 71)/9 is a plateau prime. A82702