Properties of the Number -2358

Three Hundred Fifty-Eight

Basics

Value: -2359 → -2358 → -2357

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 18

Digital Root: 9

Palindrome: No

Factorization: 2 × 3 ² × 131

Divisors: 1, 2, 3, 6, 9, 18, 131, 262, 393, 786

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: -100100110110

Octal: -4466

Duodecimal: -1446

Hexadecimal: -936

Square: 5560164

Square Root: 48.55924216871593

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

Expansion of e.g.f. exp(arcsinh(x)*arctan(x)) (even powers only). A12622

Generalized sum of divisors function: third diagonal of A060044. A60045

Expansion of log(1+tanh(x)/exp(x)). A9402

Tribonacci numbers: a(n) = a(n-1) + a(n-2) + a(n-3), with a(0) = 1, a(1) = 1, a(2) = 0. A81172

Numbers n such that BCR(n) = n, where BCR = binary-complement-and-reverse = take one's complement then reverse bit order. A35928

Starts of runs of 3 consecutive Niven numbers in base 2 (A049445). A330932

Numbers m such that there are precisely 10 groups of order m. A249553

Numbers whose binary indices and prime indices have the same sum. A372427

Triangular array T(n,k), read by rows: coefficients of strong divisibility sequence of polynomials p(1,x) = 1, p(2,x) = 1 + 5x, p(n,x) = u·p(n-1,x) + v·p(n-2,x) for n >=3, where u = p(2,x), v = 1 - x - x². A367210

Non-deficient numbers with even σ which are not Zumkeller. A171641