Properties of the Number 27951

Twenty-Seven Thousand Nine Hundred Fifty-One

Basics

Value: 27950 → 27951 → 27952

Parity: odd

Prime: No

Previous Prime: 27947

Next Prime: 27953

Digit Sum: 24

Digital Root: 6

Palindrome: No

Factorization: 3 × 7 × 11 ³

Divisors: 1, 3, 7, 11, 21, 33, 77, 121, 231, 363

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 110110100101111

Octal: 66457

Duodecimal: 14213

Hexadecimal: 6d2f

Square: 781258401

Square Root: 167.1855256892773

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 labeled 2-trees with n nodes. A36361

a(n+1)-+a(n)=prime, a(n+1)*a(n)=Average of twin prime pairs, a(1)=1,a(2)=4. A154493

Heinz numbers of integer partitions such that the difference between the length of the minimal square containing and the maximal square contained in the Young diagram is 1. A325179

Triangle read by rows: T(n,r) = number of maximum r-uniform acyclic hypergraphs of order n and size n-r+1, 1 <= r <= n+1. A135021

Numbers with a minimum of 6 polygonal roots, excluding itself. A275256

a(0)=1, a(1)=1, a(n) = 11·a(n/2) for even n, and a(n) = 10·a((n-1)/2) + a((n+1)/2) for odd n >= 3. A116525

a(n) = n*(n+1)*(6·n-5)/2. A172082

Partial sums of A007694. A174030

Number of non-stereoisomeric paraffins with n carbon atoms. A627

Number of 0..n arrays x(0..3) of 4 elements with each no smaller than the sum of its previous elements modulo (n+1). A200253