Properties of the Number 34804

Thirty-Four Thousand Eight Hundred Four

Basics

Value: 34803 → 34804 → 34805

Parity: even

Prime: No

Previous Prime: 34781

Next Prime: 34807

Digit Sum: 19

Digital Root: 1

Palindrome: No

Factorization: 2 ² × 7 × 11 × 113

Divisors: 1, 2, 4, 7, 11, 14, 22, 28, 44, 77

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1000011111110100

Octal: 103764

Duodecimal: 18184

Hexadecimal: 87f4

Square: 1211318416

Square Root: 186.55830187906406

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 partitions of n containing a clique of size 5. A183562

a(n) is the smallest number k larger than a(n-1) such that n·d(k)*sopf(k)=σ(k), where d is the number of divisors (A000005) and sopf the sum of prime factors without repetition (A008472). A134382

Numbers k for which rank of the elliptic curve y²=x³+k·x is 4. A309031

Numbers k such that σ(k) = σ(k - d(k)). A277273

The Lychrel number a(n) sets a new record for the 'Reverse and Add' steps in base 8 needed to reach a Lychrel number m < a(n) (i.e., its seed). A306850

Even numbers 2m such that A352612(2m) = A103131(2m). A352587

Number of partitions of n in which two summands (of each size) are designated. A255180

Number of partitions of 8 copies of n into distinct parts. A258286

Consider the sequence of 4-tuples {0,a,b,c} (c>=a+b; a,b,c>0) which have the smallest integer 'c' required to reach {k,k,k,k} in n steps under map {r,s,t,u}->{|r-s|,|s-t|,|t-u|,|u-r|}. This sequence gives the third term 'b' of these quadruples. A34804