Properties of the Number 48594

Forty-Eight Thousand Five Hundred Ninety-Four

Basics

Value: 48593 → 48594 → 48595

Parity: even

Prime: No

Previous Prime: 48593

Next Prime: 48611

Digit Sum: 30

Digital Root: 3

Palindrome: No

Factorization: 2 × 3 × 7 × 13 × 89

Divisors: 1, 2, 3, 6, 7, 13, 14, 21, 26, 39

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1011110111010010

Octal: 136722

Duodecimal: 24156

Hexadecimal: bdd2

Square: 2361376836

Square Root: 220.44046815410277

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

a(n) is the smallest k >= 2 such that k^2ⁿ+1 is prime, or -1 if no such k exists. A56993

Numbers b such that b⁶⁵⁵³⁶ + 1 is prime. A251597

a(n) is the denominator of the probability that a particular one of the A335573(n+1) fixed polyominoes corresponding to the free polyomino with binary code A246521(n+1) appears as the image of a simple random walk on the square lattice. A368001

Denominator of the greatest probability that a particular fixed polyomino with n cells appears as the image of a simple random walk on the square lattice. A368005

Triangle: q=2; m=1; t(n,k) = If[m == 0, n!, Product[Sum[(-1)ⁱ*StirlingS2[ k - 1, i]*(m + 1)ⁱ, {i, 0, k - 1}], {k, 1, n}]]; b(n,k,m) = If[n == 0, 1, t[n, m]/(t[k, m]*t[n - k, m])]. A156593

Triangle T(n,k) = k! * Stirling1(n,k), 1<=k<=n. A48594

G.f. A(x) satisfies: [xⁿ] A(x)⁽ⁿ⁺¹²) = 0 for n>1 with a(0)=a(1)=1. A171791

a(n) is the number of distinct n-th powers of functions {1, 2, 3, 4, 5, 6} -> {1, 2, 3, 4, 5, 6}. A103950

Number of primes of the form 1 + b⁶⁵⁵³⁶ for 1 < b < 10ⁿ. A215970