Properties of the Number -2398

Three Hundred Ninety-Eight

Basics

Value: -2399 → -2398 → -2397

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 22

Digital Root: 4

Palindrome: No

Factorization: 2 × 11 × 109

Divisors: 1, 2, 11, 22, 109, 218, 1199, 2398

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: -100101011110

Octal: -4536

Duodecimal: -147A

Hexadecimal: -95e

Square: 5750404

Square Root: 48.96937818678118

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 ∏_k>=1 1/(1 - x^k * (1 - x)). A306749

Glaisher's function U(n). A2612

a(n) = floor(a(n-1)*3/2) with a(1) = 2. A61418

Smallest multiple of n whose digits sum to n. A2998

Numbers k such that for any positive integers (a, b), if a·b = k then a + b is prime. A80715

T(n,k)=Number of nXk 0..2 arrays x(i,j) with each element horizontally, diagonally or antidiagonally next to at least one element with value (x(i,j)+1) mod 3, and upper left element zero. A230469

a(n) = a(n-1) + a(m) for n >= 4, where m = 2·n - 2 - 2^p+1 and p is the unique integer such that 2^p < n - 1 <= 2^p+1, starting with a(1) = 1, a(2) = 2, and a(3) = 3. A50051

Rectangular table, read by antidiagonals, such that the g.f. of row n, R_n(y), satisfies: R_n(y) = [ ∑_k>=0 y^k * R_k(y)ⁿ ]ⁿ for n>=0, with R₀(y) = 1. A124540

T(n,k)=Number of nXk 0..3 arrays with no element equal to zero plus the sum of elements to its left or one plus the sum of the elements above it or zero plus the sum of the elements diagonally to its northwest or zero plus the sum of the elements antidiagonally to its northeast, modulo 4. A241306

Triangle T, read by rows, that satisfies the recurrence: T(n,k) = [T⁴](n-1,k-1) + [T⁴](n-1,k) for n>k>=0, with T(n,n)=1 for n>=0, where T⁴ is the matrix 4th power of T. A113095