Properties of the Number 55677

Fifty-Five Thousand Six Hundred Seventy-Seven

Basics

Value: 55676 → 55677 → 55678

Parity: odd

Prime: No

Previous Prime: 55673

Next Prime: 55681

Digit Sum: 30

Digital Root: 3

Palindrome: No

Factorization: 3 × 67 × 277

Divisors: 1, 3, 67, 201, 277, 831, 18559, 55677

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2730 Try Today's Challenge

Representations

Binary: 1101100101111101

Octal: 154575

Duodecimal: 28279

Hexadecimal: d97d

Square: 3099928329

Square Root: 235.95974232906764

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 ∏_k>=1 ((1 + x^k) * (1 + 2·x^k)). A266819

a(n) is the smallest value of m such that prod(m) = n·length(m)*sum(m) where prod(m) is the product of the digits of m, length(m) is the number of digits of m, sum(m) is the sum of the digits of m; or 0 if no such m exists. A64022

Number of (n+2) X (2+2) 0..3 arrays with every 3 X 3 subblock row and diagonal sum equal to 0 2 4 6 or 7 and every 3 X 3 column and antidiagonal sum not equal to 0 2 4 6 or 7. A252427

T(n,k)=Number of (n+2)X(k+2) 0..3 arrays with every 3X3 subblock row and diagonal sum equal to 0 2 4 6 or 7 and every 3X3 column and antidiagonal sum not equal to 0 2 4 6 or 7. A252433

Smallest k > n where n is a 6th power modulo k. A55677