Properties of the Number -34001

Thirty-Four Thousand One

Basics

Value: -34002 → -34001 → -34000

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 8

Digital Root: 8

Palindrome: No

Factorization: 11 ² × 281

Divisors: 1, 11, 121, 281, 3091, 34001

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -1000010011010001

Octal: -102321

Duodecimal: -17815

Hexadecimal: -84d1

Square: 1156068001

Square Root: 184.39360075664231

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 2^k + 5 is prime. A59242

Numbers k such that 3^k + 10 is prime. A217137

T(n,0) + T(n,1) + ... + T(n,n), T given by A027907. A27914

T(n,k)=Number of 0..2 arrays of length n+2·k-1 with sum no more than 2·k in any length 2k subsequence (=50% duty cycle). A212232

Sum of largest parts of all partitions of n into an even number of parts. A222048

T(n,k)=Number of nXk 0..1 arrays with every element unequal to 0, 1, 2, 3, 4 or 7 king-move adjacent elements, with upper left element zero. A305769

Numbers k such that σ(φ(σ(k))) = φ(σ(φ(k))). A67160

Number of 0..2 arrays of length n+9 with sum no more than 10 in any length 10 subsequence (=50% duty cycle). A212229

Number of 0..2 arrays of length 2·n with sum no more than 2·n in any length 2n subsequence (=50% duty cycle). A212233

Number of nX4 0..1 arrays with every element unequal to 0, 1, 2, 3, 4 or 7 king-move adjacent elements, with upper left element zero. A305765