Properties of the Number -42075

Forty-Two Thousand Seventy-Five

Basics

Value: -42076 → -42075 → -42074

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 18

Digital Root: 9

Palindrome: No

Factorization: 3 ² × 5 ² × 11 × 17

Divisors: 1, 3, 5, 9, 11, 15, 17, 25, 33, 45

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: -1010010001011011

Octal: -122133

Duodecimal: -20423

Hexadecimal: -a45b

Square: 1770305625

Square Root: 205.12191496766016

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

Array: row n shows the coefficients of the characteristic polynomial of the n-th principal submatrix of max(3i-2j, 3j-2i), as in A204158. A204159

Triangle read by rows: T(n,k) is the number of binary rooted trees with n leaves of exactly k colors and all non-leaf nodes having out-degree 2. A319541

Number of Fibonacci parts in the last section of the set of partitions of n. A144117

a(n) = (2·n³ + 5·n² - 7·n)/2. A162261

Number of rooted binary leaf-multilabeled trees with n leaves on the label set [5]. A220822

Numbers k such that A360327(k) > 2·k. A360328

Enneagonal numbers for which the product of the digits is also an enneagonal number. A117052

Enneagonal numbers divisible by 9. A117796

Number of nX6 0..1 arrays with every element unequal to 0, 1, 3, 4, 5 or 8 king-move adjacent elements, with upper left element zero. A316237

a(n) = a(n-7) + a(n-4) + a(n-1) for n>1 and a(n)=1 for n<=1. A262602