Properties of the Number 7556

Seven Thousand Five Hundred Fifty-Six

Basics

Value: 7555 → 7556 → 7557

Parity: even

Prime: No

Previous Prime: 7549

Next Prime: 7559

Digit Sum: 23

Digital Root: 5

Palindrome: No

Factorization: 2 ² × 1889

Divisors: 1, 2, 4, 1889, 3778, 7556

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1110110000100

Octal: 16604

Duodecimal: 4458

Hexadecimal: 1d84

Square: 57093136

Square Root: 86.92525524840292

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 n X 3 binary arrays with a path of adjacent 1's from upper left corner to anywhere in right hand column. A69294

Square array A(n,k), n >= 0, k >= 0, read by antidiagonals, where the e.g.f. of column k is 1+g^k+1(x) with g = x-> exp(x)-1. A144150

Number of 6-level labeled rooted trees with n leaves. A405

Number of 5 X n binary arrays with a path of adjacent 1's from upper left corner to anywhere in right hand column. A69309

Number of ways to start with set {1,2,...,n} and then repeat n times: partition each set into subsets. A261280

a(1) = 10, a(n) = smallest number > a(n-1) such that the concatenation of a(n-1) and a(n) is a square. A265150

Numbers n such that the decimal number concat(2,n) is a square. A273357

Number of n-step self-avoiding walks on hexagonal lattice from (0,0) to (0,3). A5549

T(n,k)=Number of nXk 0..1 arrays with every element equal to 1, 2, 4, 5 or 6 king-move adjacent elements, with upper left element zero. A298396

Number T(n,k) of colored integer partitions of n using all colors of a k-set such that parts i have distinct color patterns in arbitrary order and each pattern for a part i has i colors in (weakly) increasing order; triangle T(n,k), n>=0, 0<=k<=n, read by rows. A309973