Properties of the Number 48216

Forty-Eight Thousand Two Hundred Sixteen

Basics

Value: 48215 → 48216 → 48217

Parity: even

Prime: No

Previous Prime: 48197

Next Prime: 48221

Digit Sum: 21

Digital Root: 3

Palindrome: No

Factorization: 2 ³ × 3 × 7 ² × 41

Divisors: 1, 2, 3, 4, 6, 7, 8, 12, 14, 21

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1011110001011000

Octal: 136130

Duodecimal: 23AA0

Hexadecimal: bc58

Square: 2324782656

Square Root: 219.5814199790137

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

Sum of the parts in the partitions of 4n into 4 parts with smallest part = 1. A239056

T(n,k)=Number of nXk arrays containing k copies of 0..n-1 with no element plus any antidiagonal neighbor equal to n-1. A265870

Fourth accumulation array, T, of the natural number array A000027, by antidiagonals. A185509

Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 21 ones. A31789

Number of nX2 arrays containing 2 copies of 0..n-1 with no element plus any antidiagonal neighbor equal to n-1. A265867

Number of 5Xn arrays containing n copies of 0..5-1 with no element plus any antidiagonal neighbor equal to 5-1. A265873

E.g.f.: exp(6·x*G(x)⁵) / G(x)⁵ where G(x) = 1 + x·G(x)⁶ is the g.f. of A002295. A251576

a(n) = (1/5ⁿ) * ∑_k=0..n² ( (binomial(n², k) * 4^k) (mod 5ⁿ) ). A376534

a(n) = T(n,n), where array T is given by A048212. A48216