Properties of the Number -2438

Four Hundred Thirty-Eight

Basics

Value: -2439 → -2438 → -2437

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 17

Digital Root: 8

Palindrome: No

Factorization: 2 × 23 × 53

Divisors: 1, 2, 23, 46, 53, 106, 1219, 2438

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: -100110000110

Octal: -4606

Duodecimal: -14B2

Hexadecimal: -986

Square: 5943844

Square Root: 49.37610758251404

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

Number of partitions of n into parts >= 3. A8483

Number of partitions of n with zero crank. A64410

Number of partitions of n in which the least part is 3. A26796

a(n) = n*(n+7). A28563

a(n) = C_n / 2 if n is even or ( C_n + C_(n-1/2) ) / 2 if n is odd, where C = Catalan numbers (A000108). A7595

Numbers n such that fractional part of e^π*sqrt(n) > 0.99. A35484

Heinz numbers of integer partitions of n into distinct perfect squares (A033461). A324587

Sum of the n-th maximal antirun of odd primes differing by more than two. A373405

Array of cycle count sequences for the table A073200. A73201

Number T(n,k) of multisets of exactly k nonempty words with a total of n letters over n-ary alphabet such that within each prefix of a word every letter of the alphabet is at least as frequent as the subsequent alphabet letter; triangle T(n,k), n>=0, 0<=k<=n, read by rows. A293808