Properties of the Number 14946

Fourteen Thousand Nine Hundred Forty-Six

Basics

Value: 14945 → 14946 → 14947

Parity: even

Prime: No

Previous Prime: 14939

Next Prime: 14947

Digit Sum: 24

Digital Root: 6

Palindrome: No

Factorization: 2 × 3 × 47 × 53

Divisors: 1, 2, 3, 6, 47, 53, 94, 106, 141, 159

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 11101001100010

Octal: 35142

Duodecimal: 8796

Hexadecimal: 3a62

Square: 223382916

Square Root: 122.25383429569807

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 lines through at least 2 points of an n X n grid of points. A18808

a(n) = n*(2·n² -3·n +7)/6 = C(n, 1) + C(n, 2) + 2·C(n, 3). A81489

a(n) = (3·n+1)*(4·n+1). A33577

Let u be any string of n digits from {0,...,6}; let f(u) = number of distinct primes, not beginning with 0, formed by permuting the digits of u to a base-7 number; then a(n) = max_u f(u). A65848

T(n,k)=Number of nXk 0..1 arrays avoiding 0 0 0 and 0 0 1 horizontally and 0 0 0 and 1 0 1 vertically. A208028

T(n,k)=Number of binary arrays of length n+2·k-1 with fewer than k ones in any length 2k subsequence (=less than 50% duty cycle). A213118

T(n,k)=Number of nXk 0..1 arrays avoiding 0 0 0 and 0 0 1 horizontally and 0 1 0 and 1 0 1 vertically. A207808

T(n,k)=Number of nXk 0..1 arrays avoiding 0 0 0 and 0 0 1 horizontally and 0 0 1 and 1 1 0 vertically. A208287

T(n,k)=Number of nXk 0..1 arrays avoiding 0 0 0 and 0 0 1 horizontally and 0 0 0 and 0 1 1 vertically. A208420

T(n,k)=Number of (n+2)X(k+2) binary arrays avoiding patterns 000 and 111 in rows and columns. A203407