Properties of the Number 55661

Fifty-Five Thousand Six Hundred Sixty-One

Basics

Value: 55660 → 55661 → 55662

Parity: odd

Prime: Yes

Previous Prime: 55639

Next Prime: 55663

Digit Sum: 23

Digital Root: 5

Palindrome: No

Factorization: 55661

Divisors: 1, 55661

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: 1101100101101101

Octal: 154555

Duodecimal: 28265

Hexadecimal: d96d

Square: 3098146921

Square Root: 235.92583580439003

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 strict odd-length integer partitions of 2n. A344650

Primes p such that the polynomial x² + x + p generates only primes for x = 0, ..., 4. A187057

Addends k > 0 such that the polynomial x² + x + k produces a record of its Hardy-Littlewood Constant. A331940

Initial primes of 5 consecutive primes with consecutive gaps 2, 4, 6, 8. A190814

Initial primes of 6 consecutive primes with consecutive gaps 2,4,6,8,10. A190817

Primes p such that the polynomial x² + x + p generates only primes for x = 1..5. A187058

Primes having only {1, 5, 6} as digits. A385779

Prime numbers p such that x² + x + p produces primes for x = 0..5 but not x = 6. A210364

Let f(m) = smallest prime that divides k² + k + m for k = 0,1,2,...; sequence gives smallest m >= 0 such that f(m) is the n-th prime. A60392

Let f(m) = smallest prime that divides k² + k + m for k = 0,1,2,...; sequence gives smallest m >= 2 such that f(m) is the n-th prime, or -1 if no such m exists. A60380