Properties of the Number 55295

Fifty-Five Thousand Two Hundred Ninety-Five

Basics

Value: 55294 → 55295 → 55296

Parity: odd

Prime: No

Previous Prime: 55291

Next Prime: 55313

Digit Sum: 26

Digital Root: 8

Palindrome: No

Factorization: 5 × 11059

Divisors: 1, 5, 11059, 55295

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1101011111111111

Octal: 153777

Duodecimal: 27BBB

Hexadecimal: d7ff

Square: 3057537025

Square Root: 235.1488890043923

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

a(n) is the smallest nonnegative integer such that a(n)! contains a string of exactly n consecutive 2's. A254447

Decimal representation of the diagonal from the origin to the corner of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 233", based on the 5-celled von Neumann neighborhood. A286969

G.f.: ∏_k>=1 (1 + 2·x^k²) / (1-x^k). A280224

a(n) = 54·n² - 1. A158656

Increasing sequence S generated by these rules: a(1)=1, and if·is in S then both 3x+2 and 4x+3 are in S. A191145

Base 7 digits are, in order, the first n terms of the periodic sequence with initial period 3,2,0,1. A37789

a(1)=2. For n >= 2, a(n) = a(n-1) + 1 + (the largest prime among the first n-1 terms of the sequence {a(k)}). A133489

Number of trees with n nodes and 8 leaves. A55295

Number of nX5 0..1 arrays with each 1 adjacent to 2 or 5 king-move neighboring 1s. A296125