Properties of the Number 48156

Forty-Eight Thousand One Hundred Fifty-Six

Basics

Value: 48155 → 48156 → 48157

Parity: even

Prime: No

Previous Prime: 48131

Next Prime: 48157

Digit Sum: 24

Digital Root: 6

Palindrome: No

Factorization: 2 ² × 3 × 4013

Divisors: 1, 2, 3, 4, 6, 12, 4013, 8026, 12039, 16052

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1011110000011100

Octal: 136034

Duodecimal: 23A50

Hexadecimal: bc1c

Square: 2319000336

Square Root: 219.4447538675737

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 partitions of n such that the number of parts having multiplicity 1 is a part and the number of distinct parts is not a part. A241444

Expansion of ∏_k=1..12 theta₃(q^k), where theta₃() is the Jacobi θ function. A320246

G.f. satisfies: A(x) = (1 + x*(1-x)*A(x)²) * (1 + x²*A(x)²). A216447

a(n) is the number of distinct five-cuboid combinations that fill an n X n X n with only strict cuboids. A386902

Number of n X n binary arrays symmetric under horizontal reflection with all ones connected only in a one by five or five by one block. A145965

Triangular array T read by rows: T(n,k)=k⁴ mod n, for k=1,2,...,n, n=1,2,... A48156

G.f. A(x) satisfies: [xⁿ] A_n-1(x) = [xⁿ] A_n-2(x) for n>2 where A_n+1(x) = A_n(A(x)) denotes iteration with A₀(x)=x. A177774