Properties of the Number 27613

Twenty-Seven Thousand Six Hundred Thirteen

Basics

Value: 27612 → 27613 → 27614

Parity: odd

Prime: No

Previous Prime: 27611

Next Prime: 27617

Digit Sum: 19

Digital Root: 1

Palindrome: No

Factorization: 53 × 521

Divisors: 1, 53, 521, 27613

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 110101111011101

Octal: 65735

Duodecimal: 13B91

Hexadecimal: 6bdd

Square: 762477769

Square Root: 166.1715980545412

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

Expansion of g.f. ∏_{k >= 1} (1 - x^k)^-k*(k+1/2). A294

Downward vertical of triangular spiral in A051682. A81272

Odd composite integers m such that U(m)² == 1 (mod m) and V(m) == 4 (mod m), where U(m) and V(m) are the m-th generalized Lucas and Pell-Lucas numbers of parameters a=4 and b=-1, respectively. A337627

Deceptive nonprimes: composite numbers k that divide the repunit R_k-1. A864

Strong pseudoprimes to base 32. A20258

Strong pseudoprimes to base 55. A20281

Strong pseudoprimes to base 74. A20300

Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 286", based on the 5-celled von Neumann neighborhood. A271123

a(n) = least semiprime with factors not previously used containing integers 2n and 2n+1 as substrings. A86887

Number of walks within N³ (the first octant of Z³) starting at (0,0,0) and consisting of n steps taken from {(-1, 0, 0), (0, -1, 0), (0, 1, 0), (0, 1, 1), (1, 1, -1)}. A150409