Properties of the Number 14948

Fourteen Thousand Nine Hundred Forty-Eight

Basics

Value: 14947 → 14948 → 14949

Parity: even

Prime: No

Previous Prime: 14947

Next Prime: 14951

Digit Sum: 26

Digital Root: 8

Palindrome: No

Factorization: 2 ² × 37 × 101

Divisors: 1, 2, 4, 37, 74, 101, 148, 202, 404, 3737

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 11101001100100

Octal: 35144

Duodecimal: 8798

Hexadecimal: 3a64

Square: 223442704

Square Root: 122.2620137246234

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

Numbers that are the sum of eight fourth powers in seven or more ways. A345582

Numbers that are the sum of eight fourth powers in exactly seven ways. A345839

Number of subsets of {1..n} with a subset summing to n + 1. A366130

a(n) is the least positive integer that can be expressed as the sum of a prime number and a fourth power of a positive integer in exactly n ways. A365292

Number of n X 4 1..2 arrays containing at least one of each value, all equal values connected, rows considered as a single number in nondecreasing order, and columns considered as a single number in nondecreasing order. A166805

Expansion of x²*(-1+x+x²)/(-1+x+x²-x³+x⁵). A107332

Coefficients of a new recursive polynomial: a = 11; b = 19; c = -8; r(x,n)=(a·x + b)*r(x, n - 1) + c·r(x, n - 2). A146751

a(n) is the least positive integer that can be expressed as the sum of a prime number and a perfect power in exactly n ways. A365294

Number of (n+2)X(5+2) 0..1 arrays with each 3X3 subblock having clockwise perimeter pattern 00000001 00000011 or 00001001. A260291

Square array read by antidiagonals: T(n,k) is the number of distinct sum-of-powers vectors (∑_{x in X} x^m, 0 <= m <= k) for subsets X of {0, ..., n-1}; n, k >= 0. A382833