Properties of the Number 34893

Thirty-Four Thousand Eight Hundred Ninety-Three

Basics

Value: 34892 → 34893 → 34894

Parity: odd

Prime: No

Previous Prime: 34883

Next Prime: 34897

Digit Sum: 27

Digital Root: 9

Palindrome: No

Factorization: 3 ² × 3877

Divisors: 1, 3, 9, 3877, 11631, 34893

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1000100001001101

Octal: 104115

Duodecimal: 18239

Hexadecimal: 884d

Square: 1217521449

Square Root: 186.79668091269716

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

T(n,k)=Number of length n+2 0..k arrays with the sum of the maximum minus twice the median plus the minimum of adjacent triples multiplied by some arrangement of +-1 equal to zero. A251428

Total number of inversions in all partitions of n into distinct parts. A271371

a(n) = 20·binomial(n,6) + 2·binomial(n,3) + 1. A341704

Number of length n+2 0..4 arrays with the sum of the maximum minus twice the median plus the minimum of adjacent triples multiplied by some arrangement of +-1 equal to zero. A251424

Number of length 5+2 0..n arrays with the sum of the maximum minus twice the median plus the minimum of adjacent triples multiplied by some arrangement of +-1 equal to zero. A251432

Number of length n+5 0..2 arrays with at most one downstep in every n consecutive neighbor pairs. A255112

T(n,k)=Number of length n+k 0..2 arrays with at most one downstep in every k consecutive neighbor pairs. A255107

Maximum of different products of partitions of n into distinct parts. A34893