Properties of the Number 48704

Forty-Eight Thousand Seven Hundred Four

Basics

Value: 48703 → 48704 → 48705

Parity: even

Prime: No

Previous Prime: 48679

Next Prime: 48731

Digit Sum: 23

Digital Root: 5

Palindrome: No

Factorization: 2 ⁶ × 761

Divisors: 1, 2, 4, 8, 16, 32, 64, 761, 1522, 3044

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1011111001000000

Octal: 137100

Duodecimal: 24228

Hexadecimal: be40

Square: 2372079616

Square Root: 220.68982758613956

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

Numbers k such that φ(k) = φ(k+1). A1274

For n >= 2, a(n) = b(n+1)+b(n)+b(n-1), where the b(i) are the ménage numbers A000179; a(0)=a(1)=1. A270

Numbers that appear exactly five times in A101402. (Also indices of fives in A101403.). A129117

Square array read by antidiagonals downwards: for n >= 2, T(k,n) is the number of permutations of [k+n] that differ in every position from both the identity permutation and a permutation consisting of k 1-cycles and one n-cycle. A335391

Numbers k such that λ(k) = λ(k+1). A173695

Number of 5-ary rooted trees with n nodes and height at most 4. A36615

a(n) = T(3n,n), where T is the array defined in A024996. A26074

Triangle of coefficients of generating function of 5-ary rooted trees of height at most n. A36607

A number n is included in the sequence if and only if the n-th integer from among those positive integers which are coprime to n+1 = the (n+1)-st integer from among those positive integers which are coprime to n. A139766

Triangle read by rows: t(n,k)=Binomial[n, k] + Binomial[k*(n - k), n]. A155798