Properties of the Number -42050

Forty-Two Thousand Fifty

Basics

Value: -42051 → -42050 → -42049

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 11

Digital Root: 2

Palindrome: No

Factorization: 2 × 5 ² × 29 ²

Divisors: 1, 2, 5, 10, 25, 29, 50, 58, 145, 290

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

8109 Try Today's Challenge

Representations

Binary: -1010010001000010

Octal: -122102

Duodecimal: -20402

Hexadecimal: -a442

Square: 1768202500

Square Root: 205.0609665440988

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

Numbers n that are the hypotenuse of exactly 12 distinct integer-sided right triangles, i.e., n² can be written as a sum of two squares in 12 ways. A97226

Numbers that are multiple-digit narcissistic numbers in exactly four bases. A256363

Numbers that are the sum of 2 nonzero squares in exactly 5 ways. A25288

Triangle read by rows: T(n,k) is the number of permutations of [1..n] with k modular progressions of rise 2, distance 1 and length 3 (n >= 0, k >= 0). A216724

Numbers k such that φ(k)²+σ(k)² is prime. A68367

Numbers that are the sum of 2 squares in exactly 5 ways. A294716

a(n) = a(1)*a(n-1) + a(2)*a(n-2) + ...+ a(n-1)*a(1) for n >= 4, with initial terms 1,-1,1. A25267

Number of 0..7 arrays x(0..n+1) of n+2 elements with zero n-1st differences. A200271