Properties of the Number -352000

Three Hundred Fifty-Two Thousand

Basics

Value: -352001 → -352000 → -351999

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 10

Digital Root: 1

Palindrome: No

Factorization: 2 ⁸ × 5 ³ × 11

Divisors: 1, 2, 4, 5, 8, 10, 11, 16, 20, 22

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4938 Try Today's Challenge

Representations

Binary: -1010101111100000000

Octal: -1257400

Duodecimal: -14B854

Hexadecimal: -55f00

Square: 123904000000

Square Root: 593.295878967653

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) = S1(n,2), where S1(n, t) = ∑_k=0..n (k^t * ∑_j=0..k binomial(n,j)). A89659

Numbers n such that n = k/d(k) has exactly 5 solutions, where d(k) = number of divisors of k. A217126

Numbers k that divide the (left) concatenation of all numbers <= k written in base 21 (most significant digit on left). A29490

Number of (n+1) X (3+1) 0..5 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 5, with no adjacent elements equal (constant-stress tilted 1 X 1 tilings). A235181

a(1)=2, a(2)=3; a(n) is the smallest k > a(n-1) such that k + a(n-1) is a multiple of a(n-2). A328724

Irregular triangle T(n,k) read by rows in which n-th row lists in colex order all series-reduced tree degree sequences D of n nodes encoded as t = ∏_{d in D} prime(d); n >= 4, 1 <= k <= A002865(n-2). A345970