Properties of the Number 14967

Fourteen Thousand Nine Hundred Sixty-Seven

Basics

Value: 14966 → 14967 → 14968

Parity: odd

Prime: No

Previous Prime: 14957

Next Prime: 14969

Digit Sum: 27

Digital Root: 9

Palindrome: No

Factorization: 3 ² × 1663

Divisors: 1, 3, 9, 1663, 4989, 14967

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 11101001110111

Octal: 35167

Duodecimal: 87B3

Hexadecimal: 3a77

Square: 224011089

Square Root: 122.3396910246221

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

a(n) = ∑_i=1..n ∑_j=1..i (prime(i) - prime(j)). A62020

a(n) = 997·n + 1009. A100776

a(n) = ∑_i=1..n φ(i)*φ(i+1), where φ(n) = A000010(n) is Euler's totient function. A330319

Number of partitions of n that do not contain 9 as a part. A27343

Numbers generated by recursive procedure a(n) = nozero(a(n-1) * 3), in which the function nozero(x) removes all zeros from x, starting with a(1) = 1. A243845

Square array A(n,k), n >= 0, k >= 0, read by antidiagonals downwards, where column k is the expansion of (B(x)/x)^k, where B(x) is the g.f. of A213639. A384620

a(n) is the smallest number which can be represented as the sum of n distinct positive cubes in exactly n ways, or 0 if no such number exists. A350270

L-th order palindromes with L > 2. A89381

Numbers k such that if you subtract k from its reversal you get a positive number with the same digits as k. A121970

Arrange n² octagons that each have area 7 so that they leave (n-1)² square gaps each with area 2; a(n) is the total area of these polygons. A86640