Properties of the Number 27995

Twenty-Seven Thousand Nine Hundred Ninety-Five

Basics

Value: 27994 → 27995 → 27996

Parity: odd

Prime: No

Previous Prime: 27983

Next Prime: 27997

Digit Sum: 32

Digital Root: 5

Palindrome: No

Factorization: 5 × 11 × 509

Divisors: 1, 5, 11, 55, 509, 2545, 5599, 27995

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 110110101011011

Octal: 66533

Duodecimal: 1424B

Hexadecimal: 6d5b

Square: 783720025

Square Root: 167.3170642821586

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 twin primes < 2ⁿ. A33843

a(n) is the length of stage n in A137843. A291753

Numbers divisible by prime(d) for each digit d in their base-6 representation, none of which may be zero. A256876

Number of (n+5) X 10 0..1 matrices with each 6 X 6 subblock idempotent. A224574

Number of walks within N² (the first quadrant of Z²) starting at (0,0), ending on the vertical axis and consisting of n steps taken from {(-1, -1), (-1, 1), (0, 1), (1, -1), (1, 1)}. A151440

Eigensequence for the Gould sequence triangle (with general term A001316(n-k) if k<=n, 0 otherwise). A185696

T(n,k)=Number of (n+5)X(k+5) 0..1 matrices with each 6X6 subblock idempotent. A224577

Define S(1) = {1}, S(n+1) = S(n) U S(n) if a(n) is even, S(n+1) = S(n) U (n+1) U S(n) if a(n) is odd. Sequence {a(n), n >= 1} is limit as n approaches infinity of S(n). (U represents concatenation.). A137843

a(n) = ∑_k=0..2n-1 T(n,k)*T(n,k+1), T given by A027926. A27995