Properties of the Number 27948

Twenty-Seven Thousand Nine Hundred Forty-Eight

Basics

Value: 27947 → 27948 → 27949

Parity: even

Prime: No

Previous Prime: 27947

Next Prime: 27953

Digit Sum: 30

Digital Root: 3

Palindrome: No

Factorization: 2 ² × 3 × 17 × 137

Divisors: 1, 2, 3, 4, 6, 12, 17, 34, 51, 68

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 110110100101100

Octal: 66454

Duodecimal: 14210

Hexadecimal: 6d2c

Square: 781090704

Square Root: 167.17655337995217

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

The sum of the elements within a jump in a Sieve of Eratosthenes table. A179545

First differences of A000219. A191659

a(n) = ∑_{k=0..floor(n/3)} binomial(k,3·n-9·k). A392273

Numbers k such that 5·2^k - 3 is prime. A58588

G.f.: x * ∑_k>=1 x^k / (1 - a(k)*x^k). A309633

Self-convolution omits 1's at positions of triangular numbers less one. A105613

Self-convolution of A105613. A105614

Triangle read by rows: T(n,k) is the number of 0-1-2 trees (i.e., ordered trees with all vertices of outdegree at most two) with n edges and k pairs of adjacent vertices of outdegree 2. A126218

Triangular array T read by rows: T(n,k) = t(n,2k+1) for 0 <= k <= n, T(n,n)=1, t given by A027926, n >= 0. A27948