Properties of the Number 48469

Forty-Eight Thousand Four Hundred Sixty-Nine

Basics

Value: 48468 → 48469 → 48470

Parity: odd

Prime: No

Previous Prime: 48463

Next Prime: 48473

Digit Sum: 31

Digital Root: 4

Palindrome: No

Factorization: 19 × 2551

Divisors: 1, 19, 2551, 48469

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1011110101010101

Octal: 136525

Duodecimal: 24071

Hexadecimal: bd55

Square: 2349243961

Square Root: 220.1567623308446

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) = ∑_k=0..n C(n,k)²*C(n-k,k), where C(n,k) denotes the binomial coefficient n!/(k!*(n-k)!). A275027

Array read by upward antidiagonals: A(n, k) = A371094(A(n-1, k)) for n > 1, k >= 1; A(1, k) = A372443(k-1). A372560

Concatenation of n in base 2 up to base 10 and n in base 10 down to base 2 is prime, all numbers are interpreted as decimals. A54258

a(n) = ((p+1)*(3p)!/((2p-1)!*(p+1)!*2p) - 3)/(3p³), where p is the n-th prime. A217772

Number of (6+2) X (n+2) 0..3 arrays with every 3 X 3 subblock row and diagonal sum equal to 0 3 5 6 or 7 and every 3 X 3 column and antidiagonal sum not equal to 0 3 5 6 or 7. A252390

Array A read by upward antidiagonals in which the entry A(n,k) in row n and column k is defined by A(n, k) = 4ⁿ*(6·k - 3 - 2*(-1)ⁿ) + (4ⁿ - 1)/3, n,k >= 1. A371100

Array A read by upward antidiagonals in which the entry A(n,k) in row n and column k is defined by A(1, k) = 8·k-7, and A(n+1, k) = A371094(A(n, k)), n,k >= 1. A371096

a(n) = T(8,n), array T given by A047858. A48469