Properties of the Number 27351

Twenty-Seven Thousand Three Hundred Fifty-One

Basics

Value: 27350 → 27351 → 27352

Parity: odd

Prime: No

Previous Prime: 27337

Next Prime: 27361

Digit Sum: 18

Digital Root: 9

Palindrome: No

Factorization: 3 ³ × 1013

Divisors: 1, 3, 9, 27, 1013, 3039, 9117, 27351

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

603 Try Today's Challenge

Representations

Binary: 110101011010111

Octal: 65327

Duodecimal: 139B3

Hexadecimal: 6ad7

Square: 748077201

Square Root: 165.38137742805264

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

First differences of A014292. A104862

∏_n>=1 (1 + a(n)*xⁿ/n!) = 1 + arcsinh(x). A353819

∏_n>=1 1 / (1 - a(n)*xⁿ/n!) = 1 + arcsinh(x). A353914

Number of n X 3 binary arrays with all 1s connected, a path of 1s from top row to lower right corner, and no 1 having more than two 1s adjacent. A163696

G.f.: imaginary part of 1/(1 - i·x - i·x²) where i=sqrt(-1). A201838

a(n) = number of partitions p of n such that the least multiplicity of the parts of p is not a part of p. A365615

a(n) = floor(5ⁿ/3ⁿ). A94974

Numbers k such that k²+1 = 2p,(k+1)²+1 = 5q, (k+2)²+1 = 10r where p, q, and r are primes. A181619

Regular triangle, T(n, k) = f(n, k) - f(n, 0) + 1, where f(n, k) = ∑_j=0..k StirlingS1(n, n-j)*binomial(n,j) + ∑_j=0..n-k StirlingS1(n, n-j)*binomial(n, j), read by rows. A176155

Number of partitions of n into distinct odd parts, the least being 5. A27351