Properties of the Number 66228

Sixty-Six Thousand Two Hundred Twenty-Eight

Basics

Value: 66227 → 66228 → 66229

Parity: even

Prime: No

Previous Prime: 66221

Next Prime: 66239

Digit Sum: 24

Digital Root: 6

Palindrome: No

Factorization: 2 ² × 3 × 5519

Divisors: 1, 2, 3, 4, 6, 12, 5519, 11038, 16557, 22076

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: 10000001010110100

Octal: 201264

Duodecimal: 323B0

Hexadecimal: 102b4

Square: 4386147984

Square Root: 257.3480133981997

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

T(n,k) is the number of (n+1) X (k+1) 0..2 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 1 (constant-stress 1 X 1 tilings). A234443

Number of (n+1) X (2+1) 0..2 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 1 (constant-stress 1 X 1 tilings). A234437

Number of (n+1) X (5+1) 0..2 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 1 (constant-stress 1 X 1 tilings). A234440

a(n) = (1/4)*A357287(n). A357288

a(n) = ∑_k=0..n-1 {[x^k] A(x)^n-k} * {[x^n-k-1] A(x)^k+1} for n>0, with a(0)=1, where g.f. A(x) = ∑_n>=0 a(n)*xⁿ. A161881

Expansion of 1/(1 - x/(1 - 8·x)^1/4). A371490

The EulerPhi(σ(EulerPhi))-perfect numbers, where the f-perfect numbers for an arithmetical function f are defined in A066218. A66228