Properties of the Number 48915

Forty-Eight Thousand Nine Hundred Fifteen

Basics

Value: 48914 → 48915 → 48916

Parity: odd

Prime: No

Previous Prime: 48907

Next Prime: 48947

Digit Sum: 27

Digital Root: 9

Palindrome: No

Factorization: 3 ² × 5 × 1087

Divisors: 1, 3, 5, 9, 15, 45, 1087, 3261, 5435, 9783

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1011111100010011

Octal: 137423

Duodecimal: 24383

Hexadecimal: bf13

Square: 2392677225

Square Root: 221.16735744679863

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-bead necklaces with 5 colors. A1869

Triangle read by rows: row n (n >= 1) contains the numbers T(n,k) = ∑_d∣n φ(d)*k^n/d/n, for k=1..n. A54631

Inverse Weigh transform of 5ⁿ. A306159

Table read by antidiagonals: T(n,k) = number of distinct n X k toroidal 0..4 arrays. A184288

Necklaces with n beads of 6 colors, no 2 adjacent beads the same color. A106368

Number of ways to color vertices of an octagon using <= n colors, allowing only rotations. A54622

a(n) = ∑_k=0..4 binomial(8,k)*binomial(n,k). A247609

Number of nonisomorphic proper colorings of partition multicycle graph using six colors. A298266

Square array read by descending antidiagonals: T(n,k) is the number of n-bead necklaces of k colors not allowing reversal, with no adjacent beads having the same color (n, k >= 1). A208535

a(n) = T(n,n-6), array T as in A055801. A55806